How *not* to solve a Sudoku

A.F. Gabor, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)

Abstract

We prove NP-hardness of a consistency checking problem that arises in certain elimination strategies for solving Sudoku-type problems.
Original languageEnglish
Pages (from-to)582-584
JournalOperations Research Letters
Volume38
Issue number6
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'How *not* to solve a Sudoku'. Together they form a unique fingerprint.

Cite this