Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
We prove the NP-hardness of a consistency checking problem that arises in certain elimination strategies for solving Sudoku-type problems.