Skip to main content
SpringerLink
Log in

On the power of single-valued nondeterministic polynomial time computations

  • Chapter
  • First Online:
Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((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.

On leave from Siemens Corporate Laboratories for Research and Technology, Munich, West Germany.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Berman L, Hartmanis J (1977) On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6: 305–322

    Google Scholar 

  • Book RV, Long TJ, Selman AL (1984) Quantitative relativizations of complexity classes. SIAM J. Comput. 13:461–487

    Google Scholar 

  • Joseph D, Young P (1985) Some remarks on witness functions for nonpolynomial and noncomplete sets in NP. Theoret. Comput. Sci. 39:225–237

    Google Scholar 

  • Ko K-I (1985) On some natural complete operators. Theoret. Comput. Sci. 37:1–30

    Google Scholar 

  • Ladner R, Lynch N, Selman AL (1975) A comparison of polynomial-time reducibilities. Theoret. Comput. Sci. 1:103–123

    Google Scholar 

  • Miller GL (1976) Riemann's hypothesis and tests for primality. J. Comput. System Sci. 13:300–317

    Google Scholar 

  • Selman AL (1985) Personal communication

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universita' di Pisa, Corso Italia 40, I-56100, Pisa, Italy

    Dieter Spreen

  2. Lehrstuhl für Betriebssysteme, Rheinisch-Westfälische Technische Hochschule Aachen, Kopernikusstr. 16, D-5100, Aachen, West Germany

    Hans Stahl

Authors
  1. Dieter Spreen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Stahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Spreen, D., Stahl, H. (1987). On the power of single-valued nondeterministic polynomial time computations. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_182

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_182

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation