|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6910
| Title: | Godel, von Neumann and the P=?NP Problem |
| Authors: | Hartmanis, Juris |
| Keywords: | computer science
technical report |
| Issue Date: | Apr-1989 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-994 |
| Abstract: | In a 1956 letter, Godel asked von Neumann about the computational complexity of an NP complete problem. In this column, we review the historic setting of this period, discuss Godel's amazing letter and why von Neumann did not solve the P = ?NP problem. |
| URI: | http://hdl.handle.net/1813/6910 |
| Appears in Collections: | Computer Science Technical Reports
Hartmanis, Juris
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
