The complexity of constructing gerechte designs

MaRDI QIDQ1010920zbMATH OpenFDO

Authors Emil R. Vaughan

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/129753, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r15.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

latin squaresgrechte designspartition of the cells of array

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Gerechte designs with rectangular regions
• On completing latin squares
• Mutually orthogonal rectangular gerechte designs
• The complexity of completing partial Latin squares
• scientific article; zbMATH DE number 3873343

Cited in

(4)

• Mutually orthogonal rectangular gerechte designs
• Gerechte designs with rectangular regions
• Constructing \((3,b)\)-Sudoku pair Latin squares
• Balanced equi-n-squares

This page was built for publication: The complexity of constructing gerechte designs

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