Advertisement

On using oracles that compute values

  • Stephen Fenner
  • Steve Homer
  • Mitsunori Ogiwara
  • Alan L. Selman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

Abstract

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. 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. 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. 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.

     

Nondeterministic reducibilities, lowness and the difference hierarchy over NPMV are also studied. The difference hierarchy for partial functions does not collapse unless the Boolean hierarchy collapses, but, surprisingly, the levels of the difference and bounded query hierarchies do not interleave (as is the case for sets) unless the polynomial hierarchy collapses.

Keywords

Polynomial Time Partial Function Input String Satisfying Assignment Polynomial Hierarchy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bei88]
    R. Beigel. NP-hard sets are P-superterse unless R = NP. Technical Report 88-04, Department of Computer Science, The Johns Hopkins University, 1988.Google Scholar
  2. [Bei91]
    R. Beigel. Bounded queries to SAT and the Boolean hierarchy. Theor. Computer Science, 84(2):199–223, 1991.Google Scholar
  3. [CT92]
    Z. Chen and S. Toda. On the complexity of computing optimal solutions. Department of Computer Science and Information Mathematics, University of Electro-Communications, Chufo-shi, Tokyo 182, Japan, 1992.Google Scholar
  4. [Kre88]
    M. Krentel. The complexity of optimization problems. J. Computer Systems Sci., 36:490–509, 1988.Google Scholar
  5. [KSW87]
    J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. Theoretical Informatics and Applications (RAIRO), 21:419–435, 1987.Google Scholar
  6. [NOS92]
    A. Naik, M. Ogiwara, and A. Selman. P-selective sets, and reducing search to decision vs. self-reducibility. manuscript, 1992.Google Scholar
  7. [Sel92]
    A. Selman. A taxonomy of complexity classes of functions. J. Comput. Systems Sci., 1992. In press.Google Scholar
  8. [War92]
    H. Wareham. On the comptutational complexity of inferring evolutionary trees. Master's thesis, Department of Computer Science, Memorial University of Newfoundland, 1992.Google Scholar
  9. [WT91]
    O. Watanabe and S. Toda. Structural analysis of the complexity of inverse functions. Math. Systems Theory, 1991. In Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Stephen Fenner
    • 1
  • Steve Homer
    • 2
  • Mitsunori Ogiwara
    • 3
  • Alan L. Selman
    • 4
  1. 1.Dept. of Computer ScienceUniversity of Southern MainePortland
  2. 2.Dept. of Computer ScienceBoston UniversityBoston
  3. 3.Dept. of Computer ScienceUniversity of Electro-CommunicationsTokyoJapan
  4. 4.Dept. of Computer ScienceSUNY at BuffaloBuffalo

Personalised recommendations