The strong exponential hierarchy collapses
Open Access
- 1 December 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (3) , 299-322
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Boolean Hierarchy II: ApplicationsSIAM Journal on Computing, 1989
- The Boolean Hierarchy I: Structural PropertiesSIAM Journal on Computing, 1988
- On sparse oracles separating feasible complexity classesInformation Processing Letters, 1988
- Complexity classes without machines: On complete languages for UPTheoretical Computer Science, 1988
- Qualitative relativizations of complexity classesJournal of Computer and System Sciences, 1985
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- AlternationJournal of the ACM, 1981
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975