The complexity of constructing gerechte designs
From MaRDI portal
Publication:1010920
zbMath1159.05010MaRDI QIDQ1010920
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
Orthogonal arrays, Latin squares, Room squares (05B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
This page was built for publication: The complexity of constructing gerechte designs