Now showing items 1-1 of 1

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

      Béjar Torres, Ramón; Fernàndez Camon, César; Mateu Piñol, Carles; Valls Marsal, Magda (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 ...