Overview

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms that this topic has flourished and matured. This book is the first comprehensive reference on combinatorial classification algorithms, with emphasis on both the general theory and application to central families of combinatorial objects, in particular, codes and designs.The book will be of great interest to researchers and can be used as course material for graduate courses in both computer science and mathematics.

Full Product Details

9781280460937

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available