There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (Q2875538): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1201.0749 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A proof of the Kepler conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal number of clues for Sudokus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The four-colour theorem / rank | |||
Normal rank | |||
Latest revision as of 21:46, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration |
scientific article |
Statements
There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (English)
0 references
8 August 2014
0 references
sudoku
0 references
minimum number of clues
0 references
hitting set problem
0 references
critical sets
0 references
