This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July/August 2004 (vol. 6 no. 4)
pp. 2
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.
Index Terms:
NP hard, NP complete
Citation:
Francis Sullivan, "From the Editors: P ≠ NP," Computing in Science and Engineering, vol. 6, no. 4, pp. 2, July-Aug. 2004, doi:10.1109/MCSE.2004.8
Usage of this product signifies your acceptance of the Terms of Use.