I was reading the Wikipedia page https://en.m.wikipedia.org/wiki/Random_self-reducibility and it states: "If an NP-complete problem is non-adaptively random self-reducible the polynomial hierarchy collapses to Σ3". I am trying to understand that statement. It seems to say if we find a problem where a random instance is hard a bunch of complexity classes are equal. Is this correct? Which complexity classes?