Classification Algorithms for Codes and Designs: 15 (Algorithms and Computation in Mathematics, 15) - Image 1

£66.39

Springer Classification Algorithms for Codes and Designs: 15 (Algorithms and Computation in Mathematics, 15)

Name: Classification Algorithms for Codes and Designs: 15 (Algorithms and Computation in Mathematics, 15)
Brand: Springer
Price: 66.39 GBP
Availability: InStock

62 black & white illustrations, 30 black

Information Systems

This is the most expensive it has ever been. Walk away.

£66 today · previous high £66 · all-time low £46

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 554 days • 554 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 554 days • 7 price levels

Days at Price

Current Price

Price Analysis

Most common price: £50 (333 days, 60.1%)

Price range: £46 - £66

Price levels: 7 different prices over 554 days

Description

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. Review 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)

Product Specifications

Brand: Springer
Model: 62 black & white illustrations, 30 black
Format: hardcover
ASIN: 3540289909
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 13 December 2005
Listed Since: 18 January 2007

Barcode

No barcode data available

Springer Classification Algorithms for Codes and Designs: 15 (Algorithms and Computation in Mathematics, 15)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Classification Algorithms for Codes and Designs: 15 (Algorithms and Computation in Mathematics, 15)

Combinatorial Designs and their Applications: 403 (Chapman & Hall/CRC Research Notes in Mathematics Series)

Perfect Codes And Related Structures

Designs and their Codes: 103 (Cambridge Tracts in Mathematics, Series Number 103)

Designs and their Codes: 103 (Cambridge Tracts in Mathematics, Series Number 103)

Algorithmic Algebraic Combinatorics and Gröbner Bases

Introduction to Combinatorial Designs (Discrete Mathematics and Its Applications)

Codes and Association Schemes (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science): DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: 13889 (Lecture Notes in Computer Science, 13889)

Asymptotic Combinatorial Coding Theory: 415 (The Springer International Series in Engineering and Computer Science, 415)

Code Design for Dependable Systems: Theory and Practical Applications

A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Codes From Difference Sets

Combinatorics of Compositions and Words (Discrete Mathematics and Its Applications)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs (Discrete Mathematics and Its Applications)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

Combinatorial Algorithms: Generation, Enumeration, and Search: 7 (Discrete Mathematics and Its Applications)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Combinatorics: Proceedings of the NATO Advanced Study Institute held at Nijenrode Castle, Breukelen, The Netherlands 8–20 July 1974: 16 (Nato Science Series C:, 16)

Combinatorics '86: Proceedings of the International Conference on Incidence Geometries and Combinatorial Structures Passo Della Mendola, Trento, Italy, 30 June-5 July, 1986

Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics: Festschrift for Antonio Campillo on the Occasion of his 65th Birthday