Nondeterministic Bounded Query Reducibilities

Abstract A query-bounded Turing machine is an oracle machine which computes its output function from a bounded number of queries to its oracle. In this paper we investigate the behavior of nondeterministic query bounded Turing machines. In particular we study how easily such machines can compute the function F A n ( x 1 ,..., x n ) from A , where A ⊆ and F A n ( x 1 ,..., x n )= X A ( x 1 ),..., X A 〉. We show that each truth-table degree contain s a set A such that F A n can be nondeterministically computed from A by asking at most one question per nondeterministic branch; and that every set of the form A also has this property. On the other hand, we show that if A is a 1-generic set, then F A n cannot be nondeterministically computed from A in less that n queries to A ; and that each non-zero r.e. Turing degree contains an r.e. set A with the same property. If the machines involved can only make queries that are part of their input, then all sets such that F A n can be computed with one query per branch are weakly r.e.

[1]  Klaus W. Wagner,et al.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1986, Theor. Comput. Sci..

[2]  J. C. E. Dekker,et al.  A theorem on hypersimple sets , 1954 .

[3]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.

[4]  Jim Kadin.  The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..

[5]  Christos H. Papadimitriou,et al.  On the complexity of unique solutions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  R. Beigel.  Query-limited reducibilities , 1988 .

[7]  William I. Gasarch,et al.  On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case , 1989, Ann. Pure Appl. Log..

[8]  Hsu-Chun Yen,et al.  Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines , 1987, SIAM J. Comput..

[9]  Amihood Amir,et al.  Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[10]  Amihood Amir,et al.  Polynomial Terse Sets , 1988, Inf. Comput..

[11]  Richard Beigel.  A structural theorem that depends quantitatively on the complexity of SAT , 1987, Computational Complexity Conference.

[12]  William I. Gasarch,et al.  On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case , 1989, Ann. Pure Appl. Log..

[13]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[14]  William I. Gasarch,et al.  Bounded query classes and the difference hierarchy , 1989, Arch. Math. Log..

[15]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[16]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[17]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[18]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..