scientific article; zbMATH DE number 3873343

MaRDI QIDQ3340871zbMATH OpenFDO

Authors Charles J. Colbourn, Marlene J. Colbourn, D. R. Stinson

Publication date 1984

zbMATH Keywords

critical setpartial Latin square

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• The complexity of completing partial Latin squares
• On completing latin squares
• Completing Latin squares: Critical sets
• scientific article; zbMATH DE number 1471069
• Completing Latin squares: Critical sets II

Cited in

(10)

• The minimum size of critical sets in latin squares
• Efficiently computing minimal sets of critical pairs
• The Sudoku completion problem with rectangular hole pattern is NP-complete
• A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five
• On completing latin squares
• Critical sets in nets and Latin squares
• The complexity of constructing gerechte designs
• On the computational complexity of defining sets
• The Computational Complexity of Choice Sets
• On the complexity of certain completion problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340871)