A Personal View of the P versus NP Problem
- 1.3k Downloads
I recently completed a general audience book on the P versus NP problem . 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  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.
KeywordsPolynomial Time Turing Machine Personal View Complete Problem Theoretical Computer Science
- 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
- 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.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 Google Scholar