The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 19:06, 5 July 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
    0 references
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    Latin square completion
    0 references
    quasigroup
    0 references
    Sudoku completion
    0 references
    NP-complete
    0 references

    Identifiers