On Using Oracles That Compute Values

This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. A multivalued partial function is polynomial-time computable with k adaptive queries to NPMV if and only if it is polynomial-time computable via 2k — 1 nonadaptive queries to NPMV. 2. A characteristic function is polynomial-time computable with k adaptive queries to NPMV if and only if it is polynomial-time computable with k adaptive queries to NP. 3. Unless the Boolean hierarchy collapses, k adaptive (nonadaptive) queries to NPMV is different than k+1 adaptive (nonadaptive) queries to NPMV for every k.

[1]  Mark W. Krentel.  The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..

[2]  Mitsunori Ogihara,et al.  P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3]  Jin-Yi Cai,et al.  The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[4]  Zhi-Zhong Chen,et al.  On the Complexity of Computing Optimal Solutions , 1990, Int. J. Found. Comput. Sci..

[5]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[6]  H. Wareham.  On the computational complexity of inferring evolutionary trees , 1992 .

[7]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[8]  Klaus W. Wagner,et al.  The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[9]  R. Beigel.  NP-hard Sets are P-Superterse Unless R = NP , 1988 .

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

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

[12]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

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

[14]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

[15]  Alan L. Selman,et al.  A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[16]  Samuel R. Buss,et al.  On truth-table reducibility to SAT and the difference hierarchy over NP , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.