Join 3,512 readers in helping fund MetaFilter (Hide)

1 posts tagged with hardproblems. (View popular tags)
Displaying 1 through 1 of 1. Subscribe:

Well, just take n=1...right?

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. [more inside]
posted by King Bee on May 4, 2011 - 19 comments

Page: 1