Advertisement

NP-Completeness

  • Bernhard Korte
  • Jens Vygen
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 21)

Abstract

For many combinatorial optimization problems a polynomial-time algorithm is known; the most important ones are presented in this book. However, there are also many important problems for which no polynomial-time algorithm is known. Although we cannot prove that none exists we can show that a polynomial-time algorithm for one “hard” (more precisely: NP-hard) problem would imply a polynomial-time algorithm for almost all problems discussed in this book (more precisely: all NP-easy problems).

References

General Literature

  1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974Google Scholar
  2. Arora, S., and Barak, B. [2009]: Computational Complexity: A Modern Approach. Cambridge University Press, New York 2009Google Scholar
  3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999Google Scholar
  4. Bovet, D.B., and Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994Google Scholar
  5. Garey, M.R., and Johnson, D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapters 1–3, 5, and 7Google Scholar
  6. Goldreich, O. [2008]: Computational Complexity: A Conceptual Perspective. Cambridge University Press, New York 2008Google Scholar
  7. Horowitz, E., and Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 11Google Scholar
  8. Johnson, D.S. [1981]: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4 (1981)Google Scholar
  9. Karp, R.M. [1975]: On the complexity of combinatorial problems. Networks 5 (1975), 45–68Google Scholar
  10. Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994Google Scholar
  11. Papadimitriou, C.H., and Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Chapters 15 and 16Google Scholar
  12. Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005Google Scholar

Cited References

  1. Adleman, L.M., Pomerance, C., and Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983), 173–206Google Scholar
  2. Agrawal, M., Kayal, N., and Saxena, N. [2004]: PRIMES is in P. Annals of Mathematics 160 (2004), 781–793Google Scholar
  3. Cook, S.A. [1971]: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158Google Scholar
  4. Edmonds, J. [1965]: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69 (1965), 67–72Google Scholar
  5. van Emde Boas, P. [1990]: Machine models and simulations. In: Handbook of Theoretical Computer Science; Volume A; Algorithms and Complexity (J. van Leeuwen, ed.), Elsevier, Amsterdam 1990, pp. 1–66Google Scholar
  6. Fürer, M. [2009]: Faster integer multiplication. SIAM Journal on Computing 39 (2009), 979–1005Google Scholar
  7. Garey, M.R., Johnson, D.S., and Stockmeyer, L. [1976]: Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976), 237–267Google Scholar
  8. Haase, C., and Kiefer, S. [2016]: The complexity of the Kth largest subset problem and related problems. Information Processing Letters 116 (1016), 111–115Google Scholar
  9. Harvey, D., van der Hoeven, J., and Lecerf, G. [2016]: Even faster integer multiplication. Journal of Complexity 36 (2016), 1–30Google Scholar
  10. Hopcroft, J.E., and Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979Google Scholar
  11. Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, pp. 85–103Google Scholar
  12. Ladner, R.E. [1975]: On the structure of polynomial time reducibility. Journal of the ACM 22 (1975), 155–171Google Scholar
  13. Lewis, H.R., and Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981Google Scholar
  14. Orlin, J.B., Punnen, A.P., and 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, eds.), Springer, Berlin 2009, pp. 519–529Google Scholar
  15. Papadimitriou, C.H., and Yannakakis, M. [1990]: On recognizing integer polyhedra. Combinatorica 10 (1990), 107–109Google Scholar
  16. Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4 (1975), 214–220Google Scholar
  17. Schönhage, A., and Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281–292Google Scholar
  18. 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, eds.), Springer, Berlin 2009, pp. 399–428Google Scholar
  19. Turing, A.M. [1936]: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2) 42 (1936), 230–265 and 43 (1937), 544–546Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2018

Authors and Affiliations

  • Bernhard Korte
    • 1
  • Jens Vygen
    • 1
  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Personalised recommendations