How \(*\)not\(*\) to solve a sudoku

DOI10.1016/J.ORL.2010.09.001zbMath1202.91043OpenAlexW1980847793MaRDI QIDQ614048

Gerhard J. Woeginger, Adriana F. Gabor

Publication date: 23 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.09.001

zbMATH Keywords

computational complexitymatching problemassignment problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Combinatorial games (91A46)

Related Items (3)

Set selection dynamical system neural networks with partial memories, with applications to Sudoku and KenKen puzzles ⋮ Combining Hopfield neural networks, with applications to grid-based mathematics puzzles ⋮ Sudoku associative memory

Cites Work

• Sudoku: Strategy versus Structure
• Unnamed Item
• Unnamed Item

This page was built for publication: How \(*\)not\(*\) to solve a sudoku