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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 9CQ1RJOES7
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A new starting-point and a new method are requisite, to insure a complete [classi cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work - on various objects, including (what became later known as) Steiner triple systems - led to several classi cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e ective (often to prove nonexistence or uniqueness), classi cation in general is about algorithms and computation. 428 pp. Englisch. N° de réf. du vendeur 9783642432507
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783642432507_new
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Excellent interdisciplinary monograph on highly applications relevant topicProvides the first comprehensive reference on combinatorial classification algorithmsAddresses both the general theory and application to central families of c. N° de réf. du vendeur 11800926
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26357401969
Quantité disponible : 4 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Classification Algorithms for Codes and Designs | Petteri Kaski (u. a.) | Taschenbuch | Algorithms and Computation in Mathematics | xi | Englisch | 2014 | Springer | EAN 9783642432507 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 104913868
Quantité disponible : 5 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 356137646
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 428 pp. Englisch. N° de réf. du vendeur 9783642432507
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18357401979
Quantité disponible : 4 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - A new starting-point and a new method are requisite, to insure a complete [classi cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work - on various objects, including (what became later known as) Steiner triple systems - led to several classi cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e ective (often to prove nonexistence or uniqueness), classi cation in general is about algorithms and computation. N° de réf. du vendeur 9783642432507
Quantité disponible : 1 disponible(s)