Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series) - Image 1

£70.24

Springer Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Name: Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 70.24 GBP
Availability: InStock

13406232

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£70 today · usual range £0–£0 · best ever £65

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 591 days • 591 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 591 days • 4 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £69-71 (544 days, 92.0%)

Price range: £65 - £75

Price levels: 4 price ranges over 591 days

Description

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text. This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal―Katona theorem on shadows, the Lovász―Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi―Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.

Product Specifications

Brand: Springer
Model: 13406232
Format: hardcover
ASIN: 3642173632
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 02 September 2011
Listed Since: 10 December 2010

Barcode

No barcode data available

Springer Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Mathematics of Paul Erdős II

The Mathematics of Paul Erdős II: 2

Surveys in Combinatorics 2021 (London Mathematical Society Lecture Note Series)

Extremal Problems for Finite Sets (Student Mathematical Library)

Mathematics via Problems: Part 3: Combinatorics: 29 (MSRI Mathematical Circles Library)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

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

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Polynomial Methods in Combinatorics (University Lecture Series)

Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

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

Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)

Combinatorial Nullstellensatz: With Applications to Graph Colouring (CRC Focus)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

A Path to Combinatorics for Undergraduates: Counting Strategies

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory: An Introduction to Enumeration and Graph Theory (Third Edition)