Extremal Combinatorics: With Applications in Computer Science - Couverture souple

Jukna, Stasys

9783642269905: Extremal Combinatorics: With Applications in Computer Science

Couverture souple

ISBN 10 : 3642269907 ISBN 13 : 9783642269905

Editeur : Springer, 2013

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 132,20

8 Neuf

De EUR 60,06

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.

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.

�diteur: Springer
Date d'�dition: 2013
Langue: anglais
ISBN 10: 3642269907
ISBN 13: 9783642269905
Reliure: Broch�
Num�ro d'�dition: 2
Nombre de pages: 436
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 132,20

Autre devise

EUR 28,91 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 60,06

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783642173639: Extremal Combinatorics: With Applications in Computer Science

Edition pr�sent�e

ISBN 10 : 3642173632 ISBN 13 : 9783642173639
Editeur : Springer-Verlag Berlin and Heide..., 2011
Couverture rigide

R�sultats de recherche pour Extremal Combinatorics: With Applications in Computer...

Image fournie par le vendeur

Extremal Combinatorics

Stasys Jukna

Edit� par Springer Berlin Heidelberg, 2013

ISBN 10 : 3642269907 ISBN 13 : 9783642269905

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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 5055029

Contacter le vendeur

Acheter neuf

EUR 60,06

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Extremal Combinatorics : With Applications in Computer Science

Stasys Jukna

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2013

ISBN 10 : 3642269907 ISBN 13 : 9783642269905

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. 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 9783642269905

Contacter le vendeur

Acheter neuf

EUR 69,54

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Extremal Combinatorics

Stasys Jukna

Edit� par Springer Berlin Heidelberg Nov 2013, 2013

ISBN 10 : 3642269907 ISBN 13 : 9783642269905

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. 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 9783642269905

Contacter le vendeur

Acheter neuf

EUR 69,54

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Extremal Combinatorics

Stasys Jukna

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2013, 2013

ISBN 10 : 3642269907 ISBN 13 : 9783642269905

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. 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 9783642269905

Contacter le vendeur