Extremal Combinatorics: With Applications in Computer Science
Book information
Description
This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.
Similar books
Extremal Combinatorics: With Applications in Computer Science
2001 · PDF
Extremal Combinatorics: With Applications in Computer Science
2011 · PDF
Boolean Function Complexity: Advances and Frontiers
2011 · PDF
Extremal Combinatorics: With Applications in Computer Science
2011 · PDF
Boolean Function Complexity: Advances and Frontiers
2011 · PDF
Crashkurs Mathematik für Informatiker
Extremal Combinatorics: With Applications in Computer Science
2001 · DJVU
Extremal Combinatorics: With Applications in Computer Science
2001 · DJVU