Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ot
on April 6, 2013
|
parent
|
context
|
favorite
| on:
Performance of Rust and Dart in Sudoku Solving
This. Most of the time when people say "NP-hard" they actually mean "no algorithm substantially better than an exhaustive search is known".
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: