On bounded query machines
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 237-243
- https://doi.org/10.1016/0304-3975(85)90168-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Relativizing complexity classes with sparse oraclesJournal of the ACM, 1986
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- On Restricting the Size of Oracles Compared with Restricting Access to OraclesSIAM Journal on Computing, 1985
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Positive Relativizations of Complexity ClassesSIAM Journal on Computing, 1983
- On the random oracle hypothesisInformation and Control, 1983
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970