Y
Hacker News
new
|
ask
|
show
|
jobs
by
marmshallow
1535 days ago
Indeed. After reading the title of the post, I thought it may be about the Cook-Levin theorem, which is about how all NP problems (of which Sudoku is one) can be reduced to one another.