Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648182 | Discrete Mathematics | 2012 | 10 Pages |
Abstract
The sudoku completion problem is a special case of the latin square completion problem and both problems are known to be NP-complete. However, in the case of a rectangular hole pattern–i.e. each column (or row) is either full or empty of symbols–it is known that the latin square completion problem can be solved in polynomial time. Conversely, we prove in this paper that the same rectangular hole pattern still leaves the sudoku completion problem NP-complete.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls,