Bounded query classes and the difference hierarchy

This publication has 16 references indexed in Scilit:

• Bounded queries to SAT and the Boolean hierarchy
  Theoretical Computer Science, 1991
• Bi-immunity results for cheatable sets
  Theoretical Computer Science, 1990
• The Boolean Hierarchy I: Structural Properties
  SIAM Journal on Computing, 1988
• Polynomial terse sets
  Information and Computation, 1988
• On truth-table reducibility to SAT and the difference hierarchy over NP
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• The difference and truth-table hierarchies for NP
  RAIRO - Theoretical Informatics and Applications, 1987
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
  Mathematical Logic Quarterly, 1987
• Hierarchies of sets and degrees below 0′
  Published by Springer Nature ,1981
• Convex subsets of 2n and bounded truth-table reducibility
  Discrete Mathematics, 1978
• Limiting recursion
  The Journal of Symbolic Logic, 1965