Riassunto
Per molti problemi di ottimizzazione combinatoria è noto un algoritmo tempopolinomiale e quelli più importanti sono presentati in questo libro. Comunque, esistono anche molti altri problemi importanti per i quali non si conosce nessun algoritmo tempo-polinomiale. Anche se non si può dimostrare che per questi problemi non esistono degli algoritmi tempo-polinomiali, si può mostrare che se esistesse un algoritmo tempo-polinomiale per anche uno solo dei problemi “difficili” (più precisamente: NP-difficili) ne esisterebbe uno per quasi tutti i problemi discussi in questo libro (più precisamente: tutti i problemi NP- facili).
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.
Riferimenti bibliografici
Letteratura generale
Aho, A.V., Hopcroft, J.E., Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin
Bovet, D.B., Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York
Garey, M.R., Johnson, D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Chapters 1–3, 5, and 7
Goldreich, O. [2008]: Computational Complexity: A Conceptual Perspective. Cambrige University Press, New York
Horowitz, E., Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac, Chapter 11
Johnson, D.S. [1981]: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4
Karp, R.M. [1975]: On the complexity of combinatorial problems. Networks 5, 45–68
Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading
Papadimitriou, C.H., Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, Chapters 15 and 16
Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin
Riferimenti citati
Adleman, L.M., Pomerance, C., Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117, 173–206
Agrawal, M., Kayal, N., Saxena, N. [2004]: PRIMES is in P. Annals of Mathematics 160, 781–793
Cook, S.A. [1971]: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, 151–158
Edmonds, J. [1965]: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69, 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, pp. 1–66
Fürer, M. [2007]: Faster integer mulitplication. Proceedings of the 39th ACM Symposium on Theory of Computing, 57–66
Garey, M.R., Johnson, D.S., Stockmeyer, L. [1976]: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237–267
Hopcroft, J.E., Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading
Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York, pp. 85–103
Ladner, R.E. [1975]: On the structure of polynomial time reducibility. Journal of the ACM 22, 155–171
Lewis, H.R., Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs
Papadimitriou, C.H., Yannakakis, M. [1990]: On recognizing integer polyhedra. Combinatorica 10, 107–109
Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4, 214–220
Schönhage, A., Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292
Turing, A.M. [1936]: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2) 42, 230–265 and 43, 544–546
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Italia
About this chapter
Cite this chapter
Korte, B., Vygen, J. (2011). NP-Completezza. In: Ottimizzazione Combinatoria. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-1523-4_15
Download citation
DOI: https://doi.org/10.1007/978-88-470-1523-4_15
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-1522-7
Online ISBN: 978-88-470-1523-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)