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 |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=55063016&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 55063016 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Nov2010 vid: 53 iid: 11 pid: 68 pub: Association for Computing Machinery artinfo: ui: 55063016 10.1145/1839676.1839677 ppf: 5 ppct: 1 formats: tig: atl: On P, NP, and Computational Complexity. aug: au: Vardi, Moshe Y. su: Computational mathematics Algorithm research Blogs Lipton, Richard Computer programming sug: subj: Computational mathematics Algorithm research Blogs Lipton, Richard Computer programming ab: 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 not equal to NP, as has previously been believed. Also discussed are the implications that this has for computer programming. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2010 holdings: @attributes: islocal: N |
|---|