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

Price loading...

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

13406232

Architecture & Microprocessors

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

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)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Extremal Problems for Finite Sets (Student Mathematical Library)

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

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

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

Combinatorial Set Theory: With a Gentle Introduction to Forcing (Springer Monographs in Mathematics)

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

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory: An Introduction to Enumeration and Graph Theory (Second Edition)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

An Invitation to Analytic Combinatorics: From One to Several Variables (Texts & Monographs in Symbolic Computation)

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

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Wiley Discrete Mathematics with Proof - Second Edition

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Introduction to Combinatorics (Discrete Mathematics and Its Applications)

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)

Combinatorial Set Theory: With a Gentle Introduction to Forcing (Springer Monographs in Mathematics)

Advanced Combinatorics: The Art of Finite and Infinite Expansions

Combinatorics, Modeling, Elementary Number Theory: From Basic To Advanced

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness

Springer Computational Invariant Theory: 130 Mathematics Book

Cohen-Macaulay Rings 2ed: Revised Edition: 39 (Cambridge Studies in Advanced Mathematics, Series Number 39)

Springer Algebraic Aspects of Cryptography - Math Textbook