Quantitative Relativizations of Complexity Classes
- 1 August 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (3) , 461-487
- https://doi.org/10.1137/0213030
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- 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
- On relativizing auxiliary pushdown machinesTheory of Computing Systems, 1979
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974