Fifty Years of P vs. NP and the Possibility of the Impossible.
The article discusses the computer science (CS) and mathematical theorem difficulty known as the polynomial (P) vs. nondeterministic polynomial problem (NP) problem, which was first introduced by computer scientists and mathematician Steve Cook in 1971. According to the article, the solution to the...
| Publicado en: | Communications of the ACM Vol. 65; no. 1; pp. 76 - 86 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jan2022
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |