On adaptive versus nonadaptive bounded query machines
- 22 May 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 82 (1) , 51-69
- https://doi.org/10.1016/0304-3975(91)90171-w
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bounded queries to SAT and the Boolean hierarchyTheoretical Computer Science, 1991
- Distinguishing conjunctive and disjunctive reducibilities by sparse setsInformation and Computation, 1989
- On Sets Truth-Table Reducible to Sparse SetsSIAM Journal on Computing, 1988
- Polynomial Terse Sets (Extended Abstract)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Self-Reducible, P-Selective, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a SetPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A Structural Theorem that Depends Quantitatively on the Complexity of SATPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- The difference and truth-table hierarchies for NPRAIRO - Theoretical Informatics and Applications, 1987
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975