Godel, von Neumann and the P=?NP Problem

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/6910
Collections
Metadata
Show full item record
Author
Hartmanis, Juris
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.
Date Issued
1989-04
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-994
Type
technical report

Statistics