How *not* to solve a Sudoku
volume 38, issue 6 pp 582-584.
Redirect to publisher's version
(publisher's version.url.txt, 43 bytes)
Repository contains one additional file which is not publicly available
We prove the NP-hardness of a consistency checking problem that arises in certain elimination strategies for solving Sudoku-type problems.
- Assignment problem
- Assignment problems
- Computational complexity
- Consistency checking
- Matching problem
- Matching problems