An unsigned reader writes "In the postmeridian 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 aspirant for an interesting set not in [P] and I feel it is worth pocket money capacious effort trying to prove this conjecture. Such a proof would be a major progress



if (lexico_globals.googleafc.ads.content.length)
{
if (lexico_globals.googleafc.ads.content.length >= 4) {
document.write(lexico_globals.googleafc.ads.contenttop);
document.write(lexico_globals.googleafc.ads.sponsoredlinks);
document.write(lex in third edition by the editors of the american stars and stripes heritage® dictionary. copyright © 2003 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.

More: - The rest...

Mark