How *not* to solve a Sudoku
November 2010
Article
volume 38, issue 6 pp 582-584.
This publication is part of collection
| Related Files |
|---|
|
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.
Keywords
- Assignment problem
- Assignment problems
- Computational complexity
- Consistency checking
- Matching problem
- Matching problems
- NP-hardness
