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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Allgemeine Literatur:
Aho, A.V., Hopcroft, J.E., und Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974
Arora, S., und Barak, B. [2009]: Computational Complexity: A Modern Approach. Cambridge University Press, New York 2009
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., und Protasi, M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999
Bovet, D.B., und Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994
Garey, M.R., und Johnson, D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Kapitel 1–3, 5, und 7
Goldreich, O. [2008]: Computational Complexity: A Conceptual Perspective. Cambrige University Press, New York 2008
Horowitz, E., und Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Kapitel 11
Johnson, D.S. [1981]: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4 (1981)
Karp, R.M. [1975]: On the complexity of combinatorial problems. Networks 5 (1975), 45–68
Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994
Papadimitriou, C.H., und Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Kapitel 15 und 16
Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005
Zitierte Literatur:
Adleman, L.M., Pomerance, C., und Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983), 173–206
Agrawal, M., Kayal, N., und Saxena, N. [2004]: PRIMES is in P. Annals of Mathematics 160 (2004), 781–793
Cook, S.A. [1971]: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158
Edmonds, J. [1965]: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69 (1965), 67–72
van Emde Boas, P. [1990]: Machine models and simulations. In: Handbook of Theoretical Computer Science; Volume A; Algorithms and Complexity (J. van Leeuwen, Hrsg.), Elsevier, Amsterdam 1990, pp. 1–66
Fürer, M. [2009]: Faster integer multiplication. SIAM Journal on Computing 39 (2009), 979–1005
Garey, M.R., Johnson, D.S., und Stockmeyer, L. [1976]: Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976), 237–267
Haase, C., und Kiefer, S. [2016]: The complexity of the K th largest subset problem and related problems. Information Processing Letters 116 (1016), 111–115
Harvey, D., van der Hoeven, J., und Lecerf, G. [2016]: Even faster integer multiplication. Journal of Complexity 36 (2016), 1–30
Hopcroft, J.E., und Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979
Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, Hrsg.), Plenum Press, New York 1972, pp. 85–103
Ladner, R.E. [1975]: On the structure of polynomial time reducibility. Journal of the ACM 22 (1975), 155–171
Lewis, H.R., und Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981
Orlin, J.B., Punnen, A.P., und Schulz, A.S. [2009]: Integer programming: optimization and evaluation are equivalent. In: Algorithms and Data Structures – Proceedings of the 11th Algorithms and Data Structures Symposium; LNCS 5664 (F. Dehne, M. Gavrilova, J.-R. Sack, C.D. Tóth, Hrsg.), Springer, Berlin 2009, pp. 519–529
Papadimitriou, C.H., und Yannakakis, M. [1990]: On recognizing integer polyhedra. Combinatorica 10 (1990), 107–109
Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4 (1975), 214–220
Schönhage, A., und Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281–292
Schulz, A.S. [2009]: On the relative complexity of 15 problems related to 0/1-integer programming. In: Research Trends in Combinatorial Optimization (W.J. Cook, L. Lovász, J. Vygen, Hrsg.), Springer, Berlin 2009, pp. 399–428
Turing, A.M. [1936]: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2) 42 (1936), 230–265 und 43 (1937), 544–546
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature
About this chapter
Cite this chapter
Korte, B., Vygen, J. (2018). NP-Vollständigkeit. In: Kombinatorische Optimierung. Masterclass. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57691-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-57691-5_15
Published:
Publisher Name: Springer Spektrum, Berlin, Heidelberg
Print ISBN: 978-3-662-57690-8
Online ISBN: 978-3-662-57691-5
eBook Packages: Life Science and Basic Disciplines (German Language)