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...
| Publicado en: | Communications of the ACM Vol. 52; no. 9; pp. 78 - 87 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2009
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |