Browsing Articles publicats (Informàtica i Enginyeria Industrial) by Subject "NP-complete"
Now showing items 1-1 of 1
(Elsevier, 2012)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 ...