@article{0e3d7a5a55814fd59e93283570a539da,
title = "How *not* to solve a Sudoku",
abstract = "We prove the NP-hardness of a consistency checking problem that arises in certain elimination strategies for solving Sudoku-type problems.",
keywords = "Assignment problem, Computational complexity, Matching problem",
author = "Gabor, {Adriana F.} and Woeginger, {Gerhard J.}",
note = "Funding Information: This research has been supported by the Netherlands Organisation for Scientific Research (NWO) , grant 639.033.403 , by DIAMANT (an NWO mathematics cluster), and by BSIK grant 03018 ( BRICKS: Basic Research in Informatics for Creating the Knowledge Society ).",
year = "2010",
month = nov,
doi = "10.1016/j.orl.2010.09.001",
language = "British English",
volume = "38",
pages = "582--584",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier B.V.",
number = "6",
}