DocumentCode
1013086
Title
From the Editors: P ≠ NP
Author
Sullivan, Franklin
Volume
6
Issue
4
fYear
2004
Firstpage
2
Lastpage
2
Abstract
When and if the statement in the title is proved, the person who proves it will win a million dollars and become an instant megastar. He or she will certainly appear on the front page of The New York Times and should expect invitations from late-night talk shows and to be the subject of a PBS Nova special. For a long time—a very long time—this fundamental open question about the relationship between P and NP has been the large white hippo blocking the main hallway of the Academy of Complexity Theory.
Keywords
NP complete; NP hard; 65; NP complete; NP hard;
fLanguage
English
Journal_Title
Computing in Science & Engineering
Publisher
ieee
ISSN
1521-9615
Type
jour
DOI
10.1109/MCSE.2004.8
Filename
1306936
Link To Document