Skip to main content
SpringerLink
Log in

Non-Deterministic Polynomial Optimization Problems and Their Approximation

  • Chapter
Analysis and Design of Algorithms in Combinatorial Optimization

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 266))

  • 247 Accesses

Abstract

NP-problems are considered in this paper as recognition problems over some alphabet Σ, i.e. A ⊂ Σ* is is an NP problem if there exists a NDTM (non-deterministic Turing machine) recognizing A in polynomial time. It is easy to show that the following theorem holds true.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A.V. AHO, J.E.HOPCROFT and J.D.ULLMAN: The Design and Analysis of Computer Algorithms, Addison Wesley (1974).

    Google Scholar 

  2. S.A.COOK: The Complexity of Theorem Proving Procedures,3-rd STOC (1971), pp. 151–158.

    Google Scholar 

  3. G.N.FREDERICKSON, M.S.HECHT and C.E.KIM: Approximation Algorithms for some Routing Problems, 17-th Annual Symposium on Foundations of Computing Sciences, pp. 216–227.

    Google Scholar 

  4. M.R.GAREY, D.S.JOHNSON and L.STOCKMEYER: Some Simplified NP-Complete Problems,6-th STOC (1974), pp. 47–63.

    Google Scholar 

  5. J.HARTMANIS and L.BERMAN: On Isomorphism and Density of NP and Other Complete Sets, 8-th STOC (1976), pp. 30–40

    Google Scholar 

  6. D.S.JOHNSON: Approximation Algorithms for Comcinatorial Problems, 5-th STOC (1973), pp.3849.

    Google Scholar 

  7. R.M.KARP: Reducibility among Combinatorial Problems, R.E.Miller and J.W.Thatcher (eds.), Plenum Press, N.Y. (1972), pp. 85–104.

    Google Scholar 

  8. D.E.KNUTH: Postcript about NP Hard Problems, SIGAT News, 23, (April 1974) pp. 15–16.

    Google Scholar 

  9. C.H.PAPADIMITRIOU and K.STEIGLITZ: Some Complexity. Results for the TSP, 8-th STOC (1976), pp. 1–9.

    Google Scholar 

  10. S.SAHNI: General Techniques for Combinatorial Approximation, TR. 76–6, University of Minnesota, Dept. of Computer Sciences, (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, TECHNION-Israel Institute of Technology, Israel

    A. Paz

  2. Dept. of Mathematics, TECHNION-Israel Institute of Technology, Israel

    S. Moran

Authors
  1. A. Paz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Moran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IASI-CNR, Istituto di Automatica, Università di Roma, Italy

    G. Ausiello  & M. Lucertini  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Wien

About this chapter

Cite this chapter

Paz, A., Moran, S. (1981). Non-Deterministic Polynomial Optimization Problems and Their Approximation. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2748-3_1

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81626-4

  • Online ISBN: 978-3-7091-2748-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation