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

DOI10.1016/j.disc.2012.07.022zbMath1252.05019DBLPjournals/dm/BejarFMV12OpenAlexW2153775163WikidataQ62043245 ScholiaQ62043245MaRDI QIDQ713152

Carles Mateu, Ramón Béjar, Cèsar Fernández, Magda Valls

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.022

zbMATH Keywords

quasigroupNP-completeLatin square completionSudoku completion

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
• Chessboard squares
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• Generating uniformly distributed random latin squares
• On completing latin squares

This page was built for publication: The Sudoku completion problem with rectangular hole pattern is NP-complete