Skip to main content
SpringerLink
Log in

NP-Vollständigkeit

  • Chapter
  • First Online:
Kombinatorische Optimierung

Part of the book series: Springer-Lehrbuch Masterclass ((MASTERCLASS))

  • 7298 Accesses

Zusammenfassung

Für viele kombinatorische Optimierungsprobleme gibt es polynomielle Algorithmen; die wichtigsten unter ihnen werden in diesem Buch besprochen. Es gibt jedoch auch viele wichtige Probleme, für die kein polynomieller Algorithmus bekannt ist. Obwohl wir nicht beweisen können, dass es diese nicht gibt, können wir aber zeigen, dass aus der Existenz eines polynomiellen Algorithmus für ein „schweres“ (genauer: NP-schweres) Problem die Existenz eines polynomiellen Algorithmus für fast alle in diesem Buch besprochenen Probleme (genauer: alle NP-leichten Probleme) folgt.

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.95
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adleman, L.M., Pomerance, C., Rumely, R.S.: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117, 173–206 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  2. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160, 781–793 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cook, S.A.: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, S. 151–158 (1971)

    Google Scholar 

  4. Edmonds, J.: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69, 67–72 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (Hrsg.) Handbook of Theoretical Computer Science, Vol. A. Algorithms and Complexity, S. 1–66. Elsevier, Amsterdam (1990)

    Google Scholar 

  6. Fürer, M.: Faster integer multiplication. SIAM Journal on Computing 39, 979–1005 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237–267 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  9. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (Hrsg.) Complexity of Computer Computations, S. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  10. Ladner, R.E.: On the structure of polynomial time reducibility. Journal of the ACM 22, 155–171 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs (1981)

    MATH  Google Scholar 

  12. Orlin, J.B., Punnen, A.P., Schulz, A.S.: Integer programming: optimization and evaluation are equivalent. In: Dehne, F., Gavrilova, M., J.-Sack, R., Tóth, C.D. (Hrsg.) Algorithms and Data Structures – Proceedings of the 11th Algorithms and Data Structures Symposium. LNCS, Bd. 5664, S. 519–529. Springer, Berlin (2009)

    Google Scholar 

  13. Papadimitriou, C.H., Yannakakis, M.: On recognizing integer polyhedra. Combinatorica 10, 107–109 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pratt, V.: Every prime has a succinct certificate. SIAM Journal on Computing 4, 214–220 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971)

    Article  MATH  Google Scholar 

  16. Schulz, A.S.: On the relative complexity of 15 problems related to 0/1-integer programming. In: Cook, W.J., Lovász, L., Vygen, J. (Hrsg.) Research Trends in Combinatorial Optimization, S. 399–428. Springer, Berlin (2009)

    Chapter  Google Scholar 

  17. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2) 42, 230–265 (1936), 43, 544–546 (1937)

    Google Scholar 

Weiterführende Literatur

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)

    Book  MATH  Google Scholar 

  3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)

    MATH  Google Scholar 

  4. Bovet, D.B., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice-Hall, New York (1994)

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Kap. 1–3, 5, 7. Freeman, San Francisco (1979)

    Google Scholar 

  6. Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambrige University Press, New York (2008)

    Book  MATH  Google Scholar 

  7. Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms, Kap. 11. Computer Science Press, Potomac (1978)

    MATH  Google Scholar 

  8. Johnson, D.S.: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4 (1981)

    Google Scholar 

  9. Karp, R.M.: On the complexity of combinatorial problems. Networks 5, 45–68 (1975)

    MathSciNet  MATH  Google Scholar 

  10. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  11. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity, Kap. 15. 16. Prentice-Hall, Englewood Cliffs (1982)

    MATH  Google Scholar 

  12. Wegener, I.: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin (2005)

    MATH  Google Scholar 

Download references

Author information

Author notes

  1. Bernhard Korte & Jens Vygen

    Present address: Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Lennestr. 2, 53113, Bonn, Deutschland

Authors and Affiliations

    Authors
    1. Bernhard Korte
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Jens Vygen
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding authors

    Correspondence to Bernhard Korte or Jens Vygen .

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 2012 Springer-Verlag Berlin Heidelberg

    About this chapter

    Cite this chapter

    Korte, B., Vygen, J. (2012). NP-Vollständigkeit. In: Kombinatorische Optimierung. Springer-Lehrbuch Masterclass. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25401-7_15

    Download citation

    Publish with us

    Policies and ethics

    Search

    Navigation