Cover Image
QR Code

The Status of the P versus NP Problem.

The article refers to a 1971 research paper by Steve Cook, "The Complexity of Theorem-Proving Procedures" and focuses on computational complexity. The Polynomial Time (P) versus Nondeterministic Polynomial-Time (NP) problem in computer science is discussed, as well as the theory of efficient algorit...

Full description

Published in:Communications of the ACM Vol. 52; no. 9; pp. 78 - 87
Main Author: FORTNOW, LANCE
Format: Article
Published: Association for Computing Machinery Sep2009
Subjects:
NP-complete problems
Computational complexity
Computational mathematics
Polynomials
Proof theory
Algorithms
Online Access:View this record in EBSCOhost

Internet

View this record in EBSCOhost