# Bounded Query Classes

@article{Wagner1990BoundedQC, title={Bounded Query Classes}, author={Klaus W. Wagner}, journal={SIAM J. Comput.}, year={1990}, volume={19}, pages={833-846} }

Polynomial time machines having restricted access to an NP oracle are investigated. Restricted access means that the number of queries to the oracle is restricted or the way in which the queries are made is restricted (e.g., queries made during truth-table reductions). Very different kinds of such restrictions result in the same or comparable complexity classes. In particular, the class $P^{\text{NP}}[O(\log n)]$ can be characterized in very different ways. Furthermore, the Boolean hierarchy is… Expand

#### Topics from this paper

#### 331 Citations

Restricted information from nonadaptive queries to NP

- Mathematics, Computer Science
- Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
- 1995

We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted… Expand

Restricted Information from Nonadaptive Queries to NP

- Computer Science, Mathematics
- Inf. Comput.
- 1996

We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators donothave full access to the answers to the queries but get only restricted… Expand

Adaptive versus nonadaptive queries to NP and p-selective sets

- Mathematics, Computer Science
- computational complexity
- 1999

It is proved that P = NP follows if for some k > 0, the class of functions that are computable in polynomial time by nonadaptively accessing an oracle in NP is effectively included in PFNP[k⌈log n⌉— 1]. Expand

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines

- Computer Science
- Fundam. Informaticae
- 1992

If certain logics are of the same expressibility then the Polynomial Hierarchy collapses and some new complete problems for the complexity class LNP via projection translations are exhibited. Expand

On Monotonous Oracle Machines

- Mathematics, Computer Science
- LATIN
- 1995

It is shown that the strongest type of the semantically restricted polynomial time oracle machines w.r.t. NP oracles is the weakest w.R.T. sparse oracles. Expand

Bounded Queries, Approximations, and the Boolean Hierarchy

- Computer Science, Mathematics
- Inf. Comput.
- 1997

This paper investigates nondeterministic bounded query classes in relation to the complexity of NP-hard approximation problems and the Boolean Hierarchy and proves that in many cases, NP-approximation problems have the upward collapse property. Expand

Bounded Queries to SAT and the Boolean Hierarchy

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1991

The complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number of queries to an NP oracle is studied and the Boolean hierarchy and the bounded query hierarchies either stand or collapse together are studied. Expand

Some Connections between Bounded Query Classes and Non-Uniform Complexity (Long Version)

- Mathematics
- 2000

Abstract Let A(x) be the characteristic function of A. Consider the function Fk (x1, . . . , xk) = A(x1) · · ·A(xk). We show that if Fk can be computed with fewer than k queries to some set X then A… Expand

Computing Functions with Parallel Queries to NP

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1995

It is shown that the number of nondeterministic bits needed for the computation of any problem in NP can be reduced by a polylogarithmic factor, and that the problem can be computed deterministically with a subexponential time bound of order 2nO(1/log log n). Expand

Commutative Queries

- Computer Science
- Inf. Comput.
- 2001

It is proved that, for computing functions, the order of oracle queries does matter, unless PH collapses, and this improves upon the previous result of E. Hemaspaandra and H. Hempel. Expand

#### References

SHOWING 1-3 OF 3 REFERENCES

The Boolean Hierarchy I: Structural Properties

- Mathematics, Computer Science
- SIAM J. Comput.
- 1988

The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels. Expand

The Boolean Hierarchy: Hardware over NP

- Mathematics, Computer Science
- Computational Complexity Conference
- 1986

The structure of the boolean hierarchy and its relations with more common classes is emphasized: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Expand

The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses

- Mathematics, Computer Science
- SIAM J. Comput.
- 1988

It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that ${\text{co-NP}} \subseteq {\text{ NP}}^S $, and therefore the polynomial time hierarchy (PH) col...