On adaptive versus nonadaptive bounded query machines
From MaRDI portal
Publication:808242
DOI10.1016/0304-3975(91)90171-WzbMath0731.68034OpenAlexW2006605275MaRDI QIDQ808242
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90171-w
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Bounded queries to SAT and the Boolean hierarchy
- A comparison of polynomial time reducibilities
- Terse, superterse, and verbose sets
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets
- The difference and truth-table hierarchies for NP
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- On Sets Truth-Table Reducible to Sparse Sets
This page was built for publication: On adaptive versus nonadaptive bounded query machines
