Isbn: 9783642269905 - extremal combinatorics: with applications in computer science (texts in theoretical computer science. an eatcs series) (4 Ergebnisse)

Sprache: Englisch
Verlag: Springer, 2013
Serie: Buch 33 von 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USARomtrade Corp.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 74,20
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Sprache: Englisch
Verlag: Springer Vieweg, 2013
Serie: Buch 33 von 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 85,73
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.…

Sprache: Englisch
Verlag: Springer, 2013
Serie: Buch 33 von 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 123,03
EUR 11,80 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10x1.10 inches. In Stock.

Sprache: Englisch
Verlag: Springer, 2013
Serie: Buch 33 von 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 68,35
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Extremal Combinatorics | With Applications in Computer Science | Stasys Jukna | Taschenbuch | Texts in Theoretical Computer Science. An EATCS Series | xxiv | Englisch | 2013 | Springer | EAN 9783642269905 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …