Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dxjones
on May 27, 2009
|
parent
|
context
|
favorite
| on:
Zero-Knowledge Sudoku: Verifying solution without ...
"When one says Sudoku is NP-complete, one should keep in mind that this refers only to an unusual type of Sudoku puzzle in which there might be multiple solutions."
http://11011110.livejournal.com/23221.html
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
http://11011110.livejournal.com/23221.html