Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Classification Algorithms for Codes and Designs - Patric R. J. Östergård,Petteri Kaski

angļu valoda
2014-11-21
133,04 € 221,74 €

-40% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 12-18 darba dienu laikā

30 dienu atgriešanas politika

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, Kirk ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Autors Patric R. J. Östergård, Petteri Kaski
Izdevējs Springer Berlin Heidelberg
Series Algorithms and Computation in Mathematics
Izlaides gads 2014
Vāka tips Mīkstais vāks
EAN 9783642432507
Rakstiet savu atsauksmi
Jūs vērtējat: Classification Algorithms for Codes and Designs
Jūsu novērtējums:

Goodreads atsauksmes

133,04 € 221,74 €