The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62043245, #quickstatements; #temporary_batch_1710286847436 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.07.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2153775163 / rank | |||
Normal rank | |||
Revision as of 18:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Sudoku completion problem with rectangular hole pattern is NP-complete |
scientific article |
Statements
The Sudoku completion problem with rectangular hole pattern is NP-complete (English)
0 references
26 October 2012
0 references
Latin square completion
0 references
quasigroup
0 references
Sudoku completion
0 references
NP-complete
0 references
