The importance of the P versus NP question

Journal of the ACM

Volumn 50, Issue 1, 2003, Pages 27-29

  Cook, Stephen ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; CRYPTOGRAPHY; DATABASE SYSTEMS; GRAPH THEORY; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

COMPLEXITY THEORY; INTEGER FACTORIZATION; SUPERPOLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 4243089408     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/602382.602398     Document Type: Article

References (14)

1. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3 (May), 501-555.
2. BAKER, T., GILL, J., AND SOLOVAY, R. 1975. Relativizations of the P =? NP question. SICOMP: SIAM J. Comput.
3. COOK, S. 1971. The complexity of theorem-proving procedures. In Conference Record of 3rd Annual ACM Symposium on Theory of Computing. ACM New York, pp. 151-158.
4. GASARCH, W. 2002. Guest column: The P=?NP poll. SIGACT NEWS 33, 2 (June), 34-47.
5. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractibility, a Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif.
6. GUREVICH, Y. 1991. Average case completeness. J. Comput. Syst. Sci. 14, 3 (June), 346-398.
7. IMPAGLIAZZO, R., SHALTIEL, R., AND WIGDERSON, A. 1999. Near-optimal conversion of hardness into pseudo-randomness. In Proceedings of the 40th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 181-190.
8. LEVIN, L. 1973. Universal search problems (in Russian). Problemy Peredachi Informatsii 9, 3, 265-266. (English translation in Trakhtenbrot, B. A.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Ann. Hist. Comput. 6 (1984), 384-400.)
9. LEVIN, L. 1973. Universal search problems (in Russian). Problemy Peredachi Informatsii 9, 3, 265-266. (English translation in Trakhtenbrot, B. A.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Ann. Hist. Comput. 6 (1984), 384-400.)
10. LEVIN, L. 1986. Average case complete problems. SIAM J. Comput. 15, 285-286.
11. RAZBOROV, A. A., AND RUDICH, S. 1997. Natural proofs. J. Comput. Syst. Sci. 55, 1 (Aug.), 24-35.
12. ROBERTSON, N., AND SEYMOUR, P. D. 1983-1995. Graph minors i-xiii. J. Combinat. Theory B.
13. SMALE, S. 1998. Mathematical problems for the next century. MATHINT: The Mathematical Intelligencer 20.
14. VAZIRANI, V. 2001. Approximation Algorithms. Springer-Verlag, Berlin, Germany.