Bounded query machines: On NP and PSPACE
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 15 (1) , 27-39
- https://doi.org/10.1016/0304-3975(81)90061-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Polynomial Space and Transitive ClosureSIAM Journal on Computing, 1979
- On languages accepted by space-bounded oracle machinesActa Informatica, 1979
- On languages specified by relative acceptanceTheoretical Computer Science, 1978
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970