Items related to Extremal Combinatorics: With Applications in Computer...
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series) - Softcover
Synopsis
Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
About the Author
The author is a professor at the Goethe Universität Frankfurt and he is also a member of the Vilnius University Institute of Mathematics and Informatics. His main fields of research are theoretical computer science and discrete mathematics, in particular complexity.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2013
- ISBN 10 3642269907
- ISBN 13 9783642269905
- BindingPaperback
- LanguageEnglish
- Number of pages436
- Rating
Buy New
View this item
US$ 78.49
Shipping:
US$ 25.20
From Germany to U.S.A.
Search results for Extremal Combinatorics: With Applications in Computer...
Stock Image
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Seller: Book Deals, Tucson, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers. 1.11. Seller Inventory # 353-3642269907-gdd
Quantity: 1 available
Seller Image
Extremal Combinatorics
Published by
Springer Berlin Heidelberg Nov 2013, 2013
ISBN 10: 3642269907
ISBN 13: 9783642269905
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 436 pp. Englisch. Seller Inventory # 9783642269905
Quantity: 2 available
Stock Image
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Seller: Book Deals, Tucson, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. New! This book is in the same immaculate condition as when it was published 1.11. Seller Inventory # 353-3642269907-new
Quantity: 1 available
Seller Image
Extremal Combinatorics : With Applications in Computer Science
Published by
Springer Berlin Heidelberg, 2013
ISBN 10: 3642269907
ISBN 13: 9783642269905
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642269905
Quantity: 1 available
Stock Image
Extremal Combinatorics
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 334 2nd Edition. Seller Inventory # 26127874780
Quantity: 4 available
Seller Image
Extremal Combinatorics
Published by
Springer Berlin Heidelberg, 2013
ISBN 10: 3642269907
ISBN 13: 9783642269905
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialistsNo special combinatorial or algebraic background is assumed, all necessary elements of linear algebra and discrete probability are introducedThe . Seller Inventory # 5055029
Quantity: Over 20 available
Stock Image
Extremal Combinatorics
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 334 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 132679939
Quantity: 4 available
Stock Image
Extremal Combinatorics: With Applications in Computer Science
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10x1.10 inches. In Stock. Seller Inventory # 3642269907
Quantity: 1 available
Stock Image
Extremal Combinatorics
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 334. Seller Inventory # 18127874774
Quantity: 4 available
Stock Image
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA77336422699076
Quantity: 1 available