A Personal View of the P versus NP Problem

  • Lance Fortnow
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7921)


I recently completed a general audience book on the P versus NP problem [1]. Writing the book has forced me to step back and take a fresh look at the question from a non-technical point of view. There are really two different P versus NP problems. One is the formal mathematical question, first formulated by Steve Cook in 1971 [2] and listed as one of the six unresolved millennium problems by the Clay Mathematics Institute. The other P versus NP problem is the one that interests physicists, biologists, economists and the mathematically-curious general public. This talk will explore both faces of the P versus NP problem and what it means for mathematics and computer science moving forward.


Polynomial Time Turing Machine Personal View Complete Problem Theoretical Computer Science 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Fortnow, L.: The Golden Ticket: P, NP and the search for the impossible. Princeton University Press, Princeton (2013)zbMATHGoogle Scholar
  2. 2.
    Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on the Theory of Computing, pp. 151–158. ACM, New York (1971)Google Scholar
  3. 3.
    Turing, A.: On computable numbers, with an application to the Etscheidungs problem. Proceedings of the London Mathematical Society 42, 230–265 (1936)MathSciNetGoogle Scholar
  4. 4.
    Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
  5. 5.
    Levin, L.: Universal’nyĭe perebornyĭe zadachi (Universal search problems: in Russian). Problemy Peredachi Informatsii 9(3), 265–266 (1973); Corrected English translation in [6]Google Scholar
  6. 6.
    Trakhtenbrot, R.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Annals of the History of Computing 6(4), 384–400 (1984)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Lance Fortnow
    • 1
  1. 1.Georgia Institute of TechologyAtlantaU.S.A.

Personalised recommendations