‹ zurück Sie sind hier:  Startseite » Buchhändler » MARZIES.de Buch- und Medienhan… » Extremal Combinatorics With Applications in Computer Science

Linksbuch Neu neu Rechtsbuch

Jukna, Stasys

Extremal Combinatorics With Applications in Computer Science (Gebundene Ausgabe)


Reihe: Texts in Theoretical Computer Science EATCS

Springer-Verlag GmbH, Springer Berlin, September 2011


2nd Edition - 411 S. - Sprache: Englisch - 242x165x30 mm Book

ISBN: 3642173632 EAN: 9783642173639

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.


Preis: 74,89 EUR
Versandkosten: 0,00 EUR
Gesamtpreis: 74,89 EUR
In den Warenkorb

Anbieter: MARZIES.de Buch- und Medienhan… (Impressum/Lieferzeit)
Katalog: HC/Informatik

Angebotene Zahlungsarten: Vorauskasse
Transparente Bestellabwicklung - Verkäufer nutzt Order-Control - klicken für mehr Information
Transparente Bestellabwicklung -
Verkäufer nutzt Order-Control

 

Produktdetails

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 second edition has been extended with substantial new material, and has been revised and updated throughout

Inhaltsverzeichnis

Preface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lovász Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales-Jewett Theorem.- Applications in Communications Complexity.- References.- Index.

Über den Autor

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.

Kritikerstimmen

From the reviews of the second edition:"This is an entertaining and impressive book. I say impressive because the author managed to cover a very large part of combinatorics in 27 short chapters, without assuming any graduate-level knowledge of the material. ... The collection of topics covered is another big advantage of the book. ... The book is ideal as reference material or for a reading course for a dedicated graduate student. One could teach a very enjoyable class from it as well ... ." (Miklós Bóna, The Mathematical Association of America, May, 2012)"[R]eaders interested in any branch of combinatorics will find this book compelling. ... This book is very suitable for advanced undergraduate and graduate mathematics and computer science majors. It requires a very solid grounding in intermediate-level combinatorics and an appreciation for several proof methods, but it is well worth the study." (G.M. White, ACM Computing Reviews, May 2012)"This is the second edition of a well-received textbook. It has been extended with new and updated results. Typographical errors in the first edition are corrected. ... This textbook is suitable for advanced undergraduate or graduate students as well as researchers working in discrete mathematics or theoretical computer science. The author's enthusiasm for the subject is evident and his writing is clear and smooth. This is a book deserving recommendation." (Ko-Wei Lih, Zentralblatt MATH, Vol. 1239, 2012)"This is an introductory book that deals with the subject of extremal combinatorics. ... The book is nicely written and the author has included many elegant and beautiful proofs. The book contains many interesting exercises that will stimulate the motivated reader to get a better understanding of this area. ... author's goal of writing a self-contained book that is more or less up to date ... and that is accessible to graduate and motivated undergraduate students in mathematics and computer science, has been successfully achieved." (Sebastian M. Cioaba, Mathematical Reviews, January, 2013)


ISBN 3-642-17363-2

ISBN 978-3-642-17363-9

Buch empfehlen Buch empfehlen
Sparen Sie Versandkosten beim Kauf weiterer Artikel dieses Buchhändlers.
Semantics, Analytics, Visualization 3rd International Workshop, SAVE-SD 2017, Perth, Australia, Apri von González-Beltrán, Alejandra (Herausgeber); Osborne, Francesco (Herausgeber); Peroni, Silvio (Herausg
53,49 EUR

The Hash Function BLAKE von Aumasson, Jean-Philippe; Meier, Willi; Phan, Raphael; Henzen, Luca
129,99 EUR

A Rigorous Semantics for BPMN 2.0 Process Diagrams von Kossak, Felix; Illibauer, Christa; Geist, Verena; Kubovy, Jan; Natschläger, Christine; Ziebermayr, T
90,94 EUR

Java kompakt Eine Einführung in die Software-Entwicklung mit Java von Hölzl, Matthias; Raed, Allaithy; Wirsing, Martin
37,99 EUR

64,19 EUR

Encryption Mechanisms for Digital Content Distribution von Kiayias, Aggelos; Pehlivanoglu, Serdar
149,99 EUR
Meine zuletzt angesehenen antiquarischen und neue Bücher
Meine letzten Buch Suchanfragen
    Noch keine Suchanfragen vorhanden.

© 2003 - 2018 by whSoft GmbH
Entdecken Sie außerdem: Antiquariatsportal · Achtung-Bücher.de · Booklink · Buchhai - Bücher Preisvergleich
Alle genannten Preise sind Bruttopreise und enthalten, soweit nicht anders vom Verkäufer angegeben, die gesetzliche Umsatzsteuer.