On P, NP, and Computational Complexity.
The article examines the significance of a blog posted by computer science blogger Richard Lipton wherein he argued the validity of a major proof in computational mathematics. Lipton made comments on the P versus NP quandary, an algorithmic theorem central to computer science. He claimed that P is n...
| Publicado en: | Communications of the ACM Vol. 53; no. 11; pp. 5 - 6 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Nov2010
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |