Qualitative relativizations of complexity classes
- 1 June 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 30 (3), 395-413
- https://doi.org/10.1016/0022-0000(85)90053-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relativizations of Unambiguous and Random Polynomial Time ClassesSIAM Journal on Computing, 1986
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Positive Relativizations of Complexity ClassesSIAM Journal on Computing, 1983
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- A uniform approach to obtain diagonal sets in complexity classesTheoretical Computer Science, 1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975