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

4.73 avg rating
( 11 ratings by Goodreads )
 
9783642269905: Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

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.

Buy New View Book
List Price: US$ 89.95
US$ 79.43

Convert Currency

Shipping: US$ 3.82
From United Kingdom to U.S.A.

Destination, Rates & Speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Stasys Jukna
Published by Springer Berlin Heidelberg 2013-11-27, Berlin (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New paperback Quantity Available: 10
Seller
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description Springer Berlin Heidelberg 2013-11-27, Berlin, 2013. paperback. Book Condition: New. Bookseller Inventory # 9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 79.43
Convert Currency

Add to Basket

Shipping: US$ 3.82
From United Kingdom to U.S.A.
Destination, Rates & Speeds

2.

Stasys Jukna
Published by Springer (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Softcover Quantity Available: 1
Seller
Rating
[?]

Book Description Springer, 2013. Book Condition: New. Bookseller Inventory # L9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 86.23
Convert Currency

Add to Basket

Shipping: US$ 2.23
From Germany to U.S.A.
Destination, Rates & Speeds

3.

Stasys Jukna
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Quantity Available: > 20
Print on Demand
Seller
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2013. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # LQ-9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 79.43
Convert Currency

Add to Basket

Shipping: US$ 11.45
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Stasys Jukna
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Quantity Available: > 20
Print on Demand
Seller
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2013. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 87.42
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

5.

STASYS JUKNA
Published by Springer (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 10
Seller
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Springer, 2013. Paperback. Book Condition: NEW. 9783642269905 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0434790

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 82.56
Convert Currency

Add to Basket

Shipping: US$ 10.18
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Jukna, Stasys
Published by Springer (2016)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 1
Print on Demand
Seller
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Springer, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9783642269905_lsuk

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 87.90
Convert Currency

Add to Basket

Shipping: US$ 4.92
From United Kingdom to U.S.A.
Destination, Rates & Speeds

7.

Jukna, Stasys
Published by Springer (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 1
Seller
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating
[?]

Book Description Springer, 2013. Paperback. Book Condition: New. book. Bookseller Inventory # 3642269907

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 99.04
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

8.

Stasys Jukna
Published by Springer Nov 2013 (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Taschenbuch Quantity Available: 1
Rating
[?]

Book Description Springer Nov 2013, 2013. Taschenbuch. Book Condition: Neu. 236x158x27 mm. 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. 412 pp. Englisch. Bookseller Inventory # 9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 86.22
Convert Currency

Add to Basket

Shipping: US$ 13.42
From Germany to U.S.A.
Destination, Rates & Speeds

9.

Jukna, Stasys (Author)
Published by Springer (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 2
Seller
Revaluation Books
(Exeter, United Kingdom)
Rating
[?]

Book Description Springer, 2013. Paperback. Book Condition: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10 inches. In Stock. Bookseller Inventory # __3642269907

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 92.88
Convert Currency

Add to Basket

Shipping: US$ 7.63
From United Kingdom to U.S.A.
Destination, Rates & Speeds

10.

Stasys Jukna
Published by Springer Nov 2013 (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Taschenbuch Quantity Available: 1
Seller
Agrios-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description Springer Nov 2013, 2013. Taschenbuch. Book Condition: Neu. 23.5x15.5x cm. 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. 412 pp. Englisch. Bookseller Inventory # 9783642269905

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 86.22
Convert Currency

Add to Basket

Shipping: US$ 19.16
From Germany to U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book