This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
General Literature
Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974
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 1999
Bovet, D.B., and Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994
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 7
Horowitz, E., and Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 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., and Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Chapters 15 and 16
Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005
Cited References
Adleman, L.M., Pomerance, C., and Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983), 173–206
Agrawal, M., Kayal, N., and 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, ed.), Elsevier, Amsterdam 1990, pp. 1–66
Hopcroft, J.E., and 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, eds.), 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., and Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981
Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4 (1975), 214–220
Schönhage, A., and Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281–292
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-546
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). NP-Completeness. In: Combinatorial Optimization. Algorithms and Combinatorics 21, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-29297-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-29297-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25684-7
Online ISBN: 978-3-540-29297-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)