[CSUSB]>> [CNS]>> [Comp Sci Dept]>> [R J Botting]>> biba.php

Bibliographic Item (1.0)

Fortnow09

  1. Lance Fortnow
  2. The status of the P versus NP problem.
  3. Commun ACM V52n9(Sep 2009)pp78-86 [ 1562164.1562186 ]
  4. =SURVEY THEORY PERFORMANCE COMPLEXITY NP NP-HARD NP-COMPLETE P=NP?
  5. "What we would gain from P = NP will make the whole Internet look like a footnote in history."
  6. "Since all the NP-complete optimization problems become easy, everything will be much more efficient. Transportation of all forms will be scheduled optimally to move people and goods around quicker and cheaper. Manufacturers can improve their production to increase speed and create less waste."
  7. probably P<>NP. But no proof yet.
  8. Quantum computers probably won't do it.
  9. For practice see [MalikZhang09]
Search for bibliographic items containing a matching string.


(Search uses POSIX regular expressions and ignores case)

Search for a specific bibliographic item by name.



To see the complete bibliography (1Mb+) select:[Bibliography]