Abstract
Composed of the levels E (i.e., ∪ c DTIME[2 cn ]), NE, P NE, NP NE, etc., the strong exponential hierarchy is an exponential-time analogue of the polynomial-time hierarchy. This paper shows that the strong exponential hierarchy collapses to P NE, its Δ 2 level. E ≠ p NE = NP NE ∪ NP NP NE ∪ … The proof stresses the use of partial census information and the exploitation of nondeterminism. Extending these techniques, we derive new quantitative relativization results: if the weak exponential hierarchy's Δ J + 1 and Σ j + 1 levels, respectively E Σ j p and NE Σ j p , do separate, this is due to the large number of queries NE makes to its Σ j p database. Our techniques provide a successful method of proving the collapse of certain complexity classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
