On using oracles that compute values

Stephen Fenner, Steve Homer, Mitsunori Ogiwara, Alan L. Selman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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

Original languageEnglish (US)
Title of host publicationSTACS 1993 - 10th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsAlain Finkel, Klaus W. Wagner, Patrice Enjalbert
PublisherSpringer Verlag
Pages399-407
Number of pages9
ISBN (Print)9783540565031
StatePublished - Jan 1 1993
Event10th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1993 - Wurzburg, Germany
Duration: Feb 25 1993Feb 27 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume665 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1993
CountryGermany
CityWurzburg
Period2/25/932/27/93

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On using oracles that compute values'. Together they form a unique fingerprint.

  • Cite this

    Fenner, S., Homer, S., Ogiwara, M., & Selman, A. L. (1993). On using oracles that compute values. In A. Finkel, K. W. Wagner, & P. Enjalbert (Eds.), STACS 1993 - 10th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 399-407). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 665 LNCS). Springer Verlag.