Relativizing time and space
- 1 October 1981
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 254-259
- https://doi.org/10.1109/sfcs.1981.39
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- On time-space classes and their relation to the theory of real additionTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Polynomial reducibilities and upward diagonalizationsPublished by Association for Computing Machinery (ACM) ,1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- 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