Positive Relativizations of Complexity Classes
- 1 August 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (3), 565-579
- https://doi.org/10.1137/0212037
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Relativizing Time, Space, and Time-SpaceSIAM Journal on Computing, 1982
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Indexings of subrecursive classesTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970