Articles liés à Extremal Combinatorics: With Applications in Computer...
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 81,44
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Extremal Combinatorics: With Applications in Computer...
Image fournie par le vendeur
Extremal Combinatorics
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642173632
ISBN 13 : 9783642173639
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : 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 . N° de réf. du vendeur 5051409
Quantité disponible : Plus de 20 disponibles
Image d'archives
Extremal Combinatorics: With Applications in Computer Science
Edité par
Springer-Verlag New York Inc, 2011
ISBN 10 : 3642173632
ISBN 13 : 9783642173639
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __3642173632
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Extremal Combinatorics : With Applications in Computer Science
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642173632
ISBN 13 : 9783642173639
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783642173639
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Extremal Combinatorics
Edité par
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10 : 3642173632
ISBN 13 : 9783642173639
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783642173639
Quantité disponible : 2 disponible(s)
Image d'archives
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In English. N° de réf. du vendeur ria9783642173639_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Extremal Combinatorics
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur S0-9783642173639
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Extremal Combinatorics
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10 : 3642173632
ISBN 13 : 9783642173639
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 436 pp. Englisch. N° de réf. du vendeur 9783642173639
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Extremal Combinatorics : With Applications in Computer Science
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 13612177-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783642173639
Quantité disponible : Plus de 20 disponibles
Image d'archives
Jukna,S.:Extremal Combinatorics.2e (eng)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
Etat : new. N° de réf. du vendeur Q6ASRTSIJF
Quantité disponible : 5 disponible(s)