Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sweeneyrod
on May 19, 2019
|
parent
|
context
|
favorite
| on:
Modern SAT solvers: fast, neat and underused
Pedantry: you can reduce TSP to SAT just because it's in NP. It's the opposite reduction (from SAT to TSP) that you can do because TSP is NP-complete.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: