An Interest In:
Web News this Week
- April 25, 2024
- April 24, 2024
- April 23, 2024
- April 22, 2024
- April 21, 2024
- April 20, 2024
- April 19, 2024
Some of Our Sources
- Mashable
- TutsPlus - Code
- Spoon Graphics
- Smashing Magazine
- Specky Boy
- Spyre Studios
- Web Resource Source
- Android Dissected
- Android Headlines
- Dev To
Help Webnuz
Referal links:
May 4, 2011 03:05 pm
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/JqcI51DIe6c/Forty-Years-of-PNP
Forty Years of P=NP?
An anonymous reader writes "In the afternoon of May 4, 1971, in the Stouffer's Somerset Inn in Shaker Heights, Ohio, Steve Cook presented his STOC paper proving that Satisfiability is NP-complete and Tautology is NP-hard. 'The theorems suggest that Tautology is a good candidate for an interesting set not in [P] and I feel it is worth spending considerable effort trying to prove this conjecture. Such a proof would be a major breakthrough in complexity theory.'And thus Cook formulated what was soon to be called the P versus NP problem. The rest is history.Here's the 1971 STOC Program (there were 143 attendees) and what that sacred ground looks like today." 
Read more of this story at Slashdot.
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/JqcI51DIe6c/Forty-Years-of-PNP
Share this article:
Tweet
View Full Article
Slashdot
Slashdot was originally created in September of 1997 by Rob "CmdrTaco" Malda. Today it is owned by Geeknet, Inc..More About this Source Visit Slashdot