A uniform approach to define complexity classes
- 1 October 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 104 (2) , 263-283
- https://doi.org/10.1016/0304-3975(92)90125-y
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Boolean Hierarchy I: Structural PropertiesSIAM Journal on Computing, 1988
- Complexity classes without machines: On complete languages for UPTheoretical Computer Science, 1988
- Immunity and simplicity in relativizations of probabilistic complexity classesRAIRO - Theoretical Informatics and Applications, 1988
- Decision trees and downward closuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Simplicity, Relativizations and NondeterminismSIAM Journal on Computing, 1985
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975