Skip to main content
SpringerLink
Log in

NP-complétude

  • Chapter
Optimisation combinatoire

Part of the book series: Collection IRIS ((IRIS))

  • 635 Accesses

Résumé

Pour de nombreux problémes d’optimisation combinatoire, on connaît un algorithme polynomial; les plus importants sont présentés dans ce livre. Cependant, il existe aussi de nombreux problémes pour lesquels on ne connaît pas d’algorithme polynomial. On ne peut pas prouver qu’il n’en existe pas, mais on peut cependant montrer que l’existence d’un algorithme polynomial pour un probléme «difficile» (plus précisément: NP-difficile) impliquerait l’existence d’un algorithme polynomial pour presque tous les problémes présentés dans ce livre (plus précisément: tous les probl’emes NP-faciles).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

Littérature générale

  • Aho, A.V., Hopcroft, J.E., Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974

    MATH  Google Scholar 

  • 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 1999

    MATH  Google Scholar 

  • Bovet, D.B., Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994

    Google Scholar 

  • Garey, M.R., 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

    Google Scholar 

  • Horowitz, E., Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 11

    MATH  Google Scholar 

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

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994

    MATH  Google Scholar 

  • Papadimitriou, C.H., Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Chapters 15 and 16

    MATH  Google Scholar 

  • Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005

    MATH  Google Scholar 

Références citées

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    MATH  MathSciNet  Google Scholar 

  • Fürer, M. [2007]: Faster integer mulitplication. Proceedings of the 39th ACM Symposium on Theory of Computing (2007), 57–66

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Hopcroft, J.E., Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979

    MATH  Google Scholar 

  • 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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Lewis, H.R., Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

  2. Faculté de mathématiques, Université Paris-VI, 175, rue du Chevaleret, 75013, Paris

    Jean Fonlupt (Professeur émérite)

  3. Panthéon-Sorbonne Centre d’économie de la Sorbonne, Université Paris-I, 106-112, boulevard de l’Hôpital, 75013, Paris

    Alexandre Skoda

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

  3. Jean Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexandre Skoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag France

About this chapter

Cite this chapter

Korte, B., Vygen, J., Fonlupt, J., Skoda, A. (2010). NP-complétude. In: Optimisation combinatoire. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-287-99037-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-2-287-99037-3_15

  • Publisher Name: Springer, Paris

  • Print ISBN: 978-2-287-99036-6

  • Online ISBN: 978-2-287-99037-3

Publish with us

Policies and ethics

Search

Navigation