Bounded queries to SAT and the Boolean hierarchy

This publication has 11 references indexed in Scilit:

• Terse, Superterse, and Verbose Sets
  Information and Computation, 1993
• Bi-immunity results for cheatable sets
  Theoretical Computer Science, 1990
• A cardinality version of Beigel's nonspeedup theorem
  The Journal of Symbolic Logic, 1989
• Bounded query classes and the difference hierarchy
  Archive for Mathematical Logic, 1989
• On Sets Truth-Table Reducible to Sparse Sets
  SIAM Journal on Computing, 1988
• The complexity of optimization problems
  Journal of Computer and System Sciences, 1988
• Polynomial terse sets
  Information and Computation, 1988
• The difference and truth-table hierarchies for NP
  RAIRO - Theoretical Informatics and Applications, 1987
• The complexity of facets (and some facets of complexity)
  Journal of Computer and System Sciences, 1984
• On the Inversion Complexity of a System of Functions
  Journal of the ACM, 1958