Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The complexity of constructing gerechte designs

From MaRDI portal
Publication:1010920
Jump to:navigation, search

zbMath1159.05010MaRDI QIDQ1010920

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


zbMATH Keywords

latin squaresgrechte designspartition of the cells of array


Mathematics Subject Classification ID

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


Related Items (3)

Gerechte designs with rectangular regions ⋮ Balanced equi-\(n\)-squares ⋮ Unnamed Item







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1010920&oldid=13005154"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 21:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki