How *not* to solve a Sudoku

2010-11-01

How not to solve a Sudoku

Operations Research Letters , Volume 38 - Issue 6 p. 582- 584

We prove the NP-hardness of a consistency checking problem that arises in certain elimination strategies for solving Sudoku-type problems.

Additional Metadata
Keywords	Assignment problem, Assignment problems, Computational complexity, Consistency checking, Matching problem, Matching problems, NP-hardness
Persistent URL	doi.org/10.1016/j.orl.2010.09.001, hdl.handle.net/1765/22168
Series	ERIM Article Series (EAS)
Journal	Operations Research Letters
Organisation	Erasmus Research Institute of Management
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Gabor, A., & Woeginger, G. (2010). How not to solve a Sudoku. Operations Research Letters, 38(6), 582–584. doi:10.1016/j.orl.2010.09.001