Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jcd748
on Nov 10, 2012
|
parent
|
context
|
favorite
| on:
Traveling Salesman: the most misunderstood problem
Yes, I've always seen SAT as the canonical example given. Though, when I did some reading into phase transitions in NP-complete problems, 3-SAT was usually the example given (and used).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: