A Note on the Karp-Lipton Collapse for the Exponential Hierarchy
نویسنده
چکیده
We extend previous collapsing results involving the exponential hierarchy by using recent hardness-randomness trade-off results. Specifically, we show that if the second level of the exponential hierarchy has polynomialsized circuits, then it collapses all the way down to MA.
منابع مشابه
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy
It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-complete set SAT...
متن کاملNew Collapse Consequences of NP Having Small Circuits
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-time hierarchy PH to ZPP(NP) under the assumption that NP has polynomial-size circuits. This improves on the well-known result of Karp, Lipton, and Sipser [KL80] stating a collapse of PH to its second level Σ2 under th...
متن کاملS2p is subset of ZPPNP
We show that the class Sp2 is contained in ZPP NP. The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that the assumption NP has small circuits collapses PH to Sp2 becomes the strongest version to date of the Karp–Lipton Theorem. We also discuss the problem of finding irrefutable proofs for Sp2 in ZPPNP. © 20...
متن کاملRobust Simulations and Significant Separations
We define and study a new notion of “robust simulations” between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of “significant separations”. A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches o...
متن کاملAutomata That Take Advice Automata That Take Advice
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
متن کامل