Abstract
Searching for a new combinatorial design can be an intimidating task. This paper is a tutorial in the art of discovering designs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Anderson, Combinatorial Designs: Construction Methods (Ellis Horwood, Chichester, England, 1990 ).
R. Mathon and A. Rosa, “Tables of Parameters of BIBDs with r 41 including existence, enumeration and resolvability results: an update,” Ars Combinatoria 30 (1990), 65–96.
G. Polya, How to Solve It (Princeton University Press, Princeton N. J., 1945 ).
E. M. Reingold, J. Nievergelt, N. Deo, Combinatorial Algorithms (Prentice Hall, Englewood Cliffs, N. J., 1977 ).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Furino, S. (1996). The First Time. In: Wallis, W.D. (eds) Computational and Constructive Design Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2497-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2497-4_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-2499-8
Online ISBN: 978-1-4757-2497-4
eBook Packages: Springer Book Archive