# Commutative queries

@article{Beigel1997CommutativeQ,
title={Commutative queries},
author={Richard Beigel and Richard Chang},
journal={Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems},
year={1997},
pages={159-165}
}
• Published 17 June 1997
• Computer Science, Mathematics
• Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, who showed that the order of the queries does not matter if the base machine asks only one query to each…
12 Citations

### Query Order and the Polynomial Hierarchy

• Computer Science, Mathematics
J. Univers. Comput. Sci.
• 1998
It is proved that all leaf language classes - and thus essentially all standard complexity classes - inherit all order-obliviousness results that hold for P. complexity levels, and it is shown that these ordered query classes form new levels in the polynomial hierarchy unless the poynomial hierarchy collapses.

### An Introduction to Query Order

• Computer Science
Bull. EATCS
• 1997
The study of query order has yielded dividends in seemingly unrelated areas, such as bottleneck computations and downward translation of equality, and some of the central results are presented.

### R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness

• Mathematics
ArXiv
• 1999
It is proved that a relatively natural complexity class, \rsnnp - a downward closure of NP, has Turing-complete sets but has no many-one complete sets, and it is shown that in the same relativized world this class has 2-truth-table complete sets but lacks 1- Truth- table complete sets.

### Bounded Queries, Approximations, and the Boolean Hierarchy

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.

### Query Order in the Polynomial Hierarchy

• Computer Science, Mathematics
FCT
• 1997
It is proved that all leaf language classes---and thus essentially all standard complexity classes---inherit all order-obliviousness results that hold for P.

### On the commutativity of jumps

It is shown that if A1 ….. Ak are jumps that are not too close together, then all three of these classes are identical and are not changed if the authors permute (r1…..rkAk).

### Self-Specifying Machines

• Mathematics
Int. J. Found. Comput. Sci.
• 1999
The computational power of machines that specify their own acceptance types are studied, and it is shown that they accept exactly the languages in R^(#P)_m(NP).

### RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness

• Computer Science
Theory of Computing Systems
• 1998
It is proved that a relatively natural complexity class, a downward closure of NP, has many equivalent forms having to do with ordered and parallel access to NP and NP ∩ coNP.

### The Computational Complexity Column

• Computer Science, Mathematics
• 1998
Williams' proof that NEXP 6⊆ ACC proceeds via a new algorithm for ACC-SAT beating brute-force search is the centrepiece of the article, which exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds.

## References

SHOWING 1-10 OF 24 REFERENCES

### Bounded query computations

• K. Wagner
• Computer Science
[1988] Proceedings. Structure in Complexity Theory Third Annual Conference
• 1988
The main topics are: the relationship between the number of adaptive and parallel queries, connections to the closure of NP under polynomial-time truth-table reducibility, the Boolean hierarchy, the power of one more query, sparse oracles versus few queries, and natural complete problems for the most important bounded query classes.

### Modulo Information from Nonadaptive Queries to NP

• Computer Science
Electron. Colloquium Comput. Complex.
• 1996
The classes of languages accepted by nondeterministic polynomial-time Turing machines that have restricted access to an NP oracle coincide with an appropriate level of the Boolean hierarchy when m is even or k 2m, and the results are generalized to the case when the NP machines are replaced by Turing machines accepting languages of the l th level of.

### Bounded Query Classes

The Boolean hierarchy is generalized in such a way that it is possible to characterize P and O in terms of the generalization, and the class $P^{\text{NP}}[O(\log n)]$ can be characterized in very different ways.

### Separating the polynomial-time hierarchy by oracles

• A. Yao
• Computer Science, Mathematics
• 1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply that there exists an oracle set A such that, relative to A, all the

### Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)

• A. Yao
• Computer Science
FOCS
• 1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply that there exists an oracle set A such that, relative to A, all the

### Counting, Selecting, adn Sorting by Query-Bounded Machines

• Computer Science, Mathematics
STACS
• 1993
It is shown that in the case of NP-complete sets the lower bounds for counting and selecting hold unless P=NP, and that sets for which these functions have a low query-complexity must be easy in some sense.

### Bounded Queries, Approximations, and the Boolean Hierarchy

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.

### Query Order in the Polynomial Hierarchy

• Computer Science, Mathematics
FCT
• 1997
It is proved that all leaf language classes---and thus essentially all standard complexity classes---inherit all order-obliviousness results that hold for P.

### Some connections between bounded query classes and nonuniform complexity

• Computer Science, Mathematics
Proceedings Fifth Annual Structure in Complexity Theory Conference
• 1990
It is shown that if there is a polynomial-time algorithm that tests k(n)=O(log n) points for membership in a set A by making only k(n)-1 adaptive queries to an oracle set X, then A belongs to NP/poly