Advertisement

On the power of single-valued nondeterministic polynomial time computations

  • Dieter Spreen
  • Hans Stahl
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Abstract

The aim of this paper is to characterize the power of single-valued nondeterministic polynomial-time computations. As it is shown, the sets P, NP and NP∩co-NP are the domains or ranges respectively of certain types of functions computable in this way. With the help of polynomial time-bounded oracle Turing machines different computability concepts are introduced which turn out to be stronger and/or weaker than deterministic and single-valued nondeterministic polynomial-time computability. Whether they are properly stronger or weaker depends on the solution of NP=?co-NP, P=?NP∩co-NP and P=?NP, respectively.

Keywords

Polynomial Time Partial Function Converse Implication Computation Path State Query 
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. Berman L, Hartmanis J (1977) On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6: 305–322Google Scholar
  2. Book RV, Long TJ, Selman AL (1984) Quantitative relativizations of complexity classes. SIAM J. Comput. 13:461–487Google Scholar
  3. Joseph D, Young P (1985) Some remarks on witness functions for nonpolynomial and noncomplete sets in NP. Theoret. Comput. Sci. 39:225–237Google Scholar
  4. Ko K-I (1985) On some natural complete operators. Theoret. Comput. Sci. 37:1–30Google Scholar
  5. Ladner R, Lynch N, Selman AL (1975) A comparison of polynomial-time reducibilities. Theoret. Comput. Sci. 1:103–123Google Scholar
  6. Miller GL (1976) Riemann's hypothesis and tests for primality. J. Comput. System Sci. 13:300–317Google Scholar
  7. Selman AL (1985) Personal communicationGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Dieter Spreen
    • 1
  • Hans Stahl
    • 2
  1. 1.Dipartimento di InformaticaUniversita' di PisaPisaItaly
  2. 2.Lehrstuhl für BetriebssystemeRheinisch-Westfälische Technische Hochschule AachenAachenWest Germany

Personalised recommendations