Pages that link to "Item:Q2875538"
From MaRDI portal
The following pages link to There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (Q2875538):
Displaying 15 items.
- Sudoku rectangle completion (extended abstract) (Q322367) (← links)
- Critical sets for Sudoku and general graph colorings (Q393178) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- On the number of Sudoku squares (Q1783641) (← links)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- Minimal number of clues for Sudokus (Q2445089) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- A new algorithm for enumerating all possible Sudoku squares (Q3178156) (← links)
- What (Quilting) Circles Can Be Squared? (Q5108580) (← links)
- DIVISION SUDOKUS: INVARIANTS, ENUMERATION, AND MULTIPLE PARTITIONS (Q5116563) (← links)
- Quantum Mechanics and Global Determinism (Q5134956) (← links)
- (Q5212149) (← links)
- Sudoku number of graphs (Q6085209) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
