Classification Algorithms for Codes and Designs: Algorithms and Computation in Mathematics, cartea 15
Autor Petteri Kaski, Patric R.J. Östergården Limba Engleză Hardback – 13 dec 2005
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 718.02 lei 43-57 zile | |
Springer Berlin, Heidelberg – 21 noi 2014 | 718.02 lei 43-57 zile | |
Hardback (1) | 723.74 lei 43-57 zile | |
Springer Berlin, Heidelberg – 13 dec 2005 | 723.74 lei 43-57 zile |
Din seria Algorithms and Computation in Mathematics
- 15% Preț: 657.56 lei
- 18% Preț: 714.17 lei
- 15% Preț: 590.26 lei
- Preț: 479.08 lei
- 15% Preț: 630.01 lei
- Preț: 396.91 lei
- Preț: 393.93 lei
- Preț: 389.98 lei
- 18% Preț: 1098.39 lei
- 15% Preț: 488.86 lei
- 20% Preț: 643.08 lei
- 15% Preț: 469.55 lei
- Preț: 389.39 lei
- 15% Preț: 579.20 lei
- Preț: 385.44 lei
- 20% Preț: 323.77 lei
- 18% Preț: 942.86 lei
- 23% Preț: 638.32 lei
- 15% Preț: 584.50 lei
- Preț: 390.14 lei
- 18% Preț: 771.81 lei
- 15% Preț: 686.90 lei
- 18% Preț: 744.06 lei
- 20% Preț: 1130.58 lei
- 18% Preț: 945.95 lei
- 20% Preț: 334.60 lei
- Preț: 499.24 lei
Preț: 723.74 lei
Preț vechi: 882.62 lei
-18% Nou
Puncte Express: 1086
Preț estimativ în valută:
138.51€ • 143.87$ • 115.05£
138.51€ • 143.87$ • 115.05£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540289906
ISBN-10: 3540289909
Pagini: 428
Ilustrații: XI, 412 p. With online files/update.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.76 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540289909
Pagini: 428
Ilustrații: XI, 412 p. With online files/update.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.76 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Graphs, Designs, and Codes.- Representations and Isomorphism.- Isomorph-Free Exhaustive Generation.- Auxiliary Algorithms.- Classification of Designs.- Classification of Codes.- Classification of Related Structures.- Prescribing Automorphism Groups.- Validity of Computational Results.- Computational Complexity.- Nonexistence of Projective Planes of Order 10.
Recenzii
From the reviews:
"The authors of this book have been responsible for some quite remarkable combinatorial enumeration results … . They are therefore well-qualified to provide this comprehensive survey of state-of-the-art algorithms for the classification of codes and designs. … Overall the book is a timely and authoritative work, and an extremely valuable reference for any researcher working in the field of combinatorial classification." (Peter B.Gibbons, Zentralblatt MATH, Vol. 1089 (15), 2006)
"For any researcher involved with combinatorial algorithms, this book is a must-have. It is absolutely essential for anyone doing enumeration algorithms on t-designs or codes. … This is one of the few useful books on combinatorial design algorithms. … Finally, the book contains (open) research problems sprinkled throughout, which should be useful for researchers … . It would make a good textbook for a senior undergraduate or a graduate course on computing in design and coding theory." (G. H. J. Van Rees and Pak Ching Li, Mathematical Reviews, Issue 2008 a)
"The authors of this book have been responsible for some quite remarkable combinatorial enumeration results … . They are therefore well-qualified to provide this comprehensive survey of state-of-the-art algorithms for the classification of codes and designs. … Overall the book is a timely and authoritative work, and an extremely valuable reference for any researcher working in the field of combinatorial classification." (Peter B.Gibbons, Zentralblatt MATH, Vol. 1089 (15), 2006)
"For any researcher involved with combinatorial algorithms, this book is a must-have. It is absolutely essential for anyone doing enumeration algorithms on t-designs or codes. … This is one of the few useful books on combinatorial design algorithms. … Finally, the book contains (open) research problems sprinkled throughout, which should be useful for researchers … . It would make a good textbook for a senior undergraduate or a graduate course on computing in design and coding theory." (G. H. J. Van Rees and Pak Ching Li, Mathematical Reviews, Issue 2008 a)
Caracteristici
Excellent interdisciplinary monograph on highly applications relevant topic Provides the first comprehensive reference on combinatorial classification algorithms Addresses both the general theory and application to central families of combinatorial objects