Bounded query machines: On NP() and NPQUERY()
- 1 January 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 15 (1) , 41-50
- https://doi.org/10.1016/0304-3975(81)90062-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- On languages accepted by space-bounded oracle machinesActa Informatica, 1979
- Rudimentary Predicates and Relative ComputationSIAM Journal on Computing, 1978
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- A generator of context-sensitive languagesJournal of Computer and System Sciences, 1969