The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/dm/BejarFMV12, #quickstatements; #temporary_batch_1731468600454 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chessboard squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On completing latin squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generating uniformly distributed random latin squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2741510 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/dm/BejarFMV12 / rank | |||
Normal rank |
Latest revision as of 04:34, 13 November 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
0 references
0 references