|
|
|
|
|
by Someone
5273 days ago
|
|
Proving something about a NxN grid does not have much to do with a problem being NP-complete. For example, the fact that it is not very hard to proof that a 1x1 sudoku requires 1 clue does not prove that sudoku is not NP-complete. |
|