"The Sudoku completion problem with rectangular hole pattern is NP-complete."

Ramón Béjar et al. (2012)
a service of Schloss Dagstuhl - Leibniz Center for Informatics