Query complexity, or why is it difficult to separate NPA∩coNPA from PA by random oracles A?

Research output: Contribution to journalArticle

47 Citations (Scopus)


By the query-time complexity of a relativized algorithm we mean the total length of oracle queries made; the query-space complexity is the maximum length of the queries made. With respect to these cost measures one can define polynomially time- or space-bounded deterministic, nondeterministic, alternating, etc. Turing machines and the corresponding complexity classes. It turns out that all known relativized separation results operate essentially with this cost measure. Therefore, if certain classes do not separate in the query complexity model, this can be taken as an indication that their relativized separation in the classical cost model will require entirely new principles. A notable unresolved question in relativized complexity theory is the separation of NPA∩ ∩ co NPA from PA under random oracles A. We conjecture that the analogues of these classes actually coincide in the query complexity model, thus indicating an answer to the question in the title. As a first step in the direction of establishing the conjecture, we prove the following result, where polynomial bounds refer to query complexity. If two polynomially query-time-bounded nondeterministic oracle Turing machines accept precisely complementary (oracle dependent) languages LA and {0, 1}*{set minus}LA under every oracle A then there exists a deterministic polynomially query-time-bounded oracle Turing machine that accept LA. The proof involves a sort of greedy strategy to selecting deterministically, from the large set of prospective queries of the two nondeterministic machines, a small subset that suffices to perform an accepting computation in one of the nondeterministic machines. We describe additional algorithmic strategies that may resolve the same problem when the condition holds for a (1-ε) fraction of the oracles A, a step that would bring us to a non-uniform version of the conjecture. Thereby we reduce the question to a combinatorial problem on certain pairs of sets of partial functions on finite sets.

Original languageEnglish
Pages (from-to)385-392
Number of pages8
Issue number4
Publication statusPublished - Dec 1 1989


  • AMS subject classification (1980): 68Q15

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Query complexity, or why is it difficult to separate NP<sup>A</sup>∩coNP<sup>A</sup> from P<sup>A</sup> by random oracles A?'. Together they form a unique fingerprint.

  • Cite this