Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
shadytrees
on Feb 17, 2009
|
parent
|
context
|
favorite
| on:
Graph of NP-Complete Problems
I also wonder circuit satisfiability is tacked as a nexus in the graph. 3-SAT seems like a better choice due to Cook's theorem being such a big deal.
http://en.wikipedia.org/wiki/Cook–Levin_theorem
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
http://en.wikipedia.org/wiki/Cook–Levin_theorem