Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Jukna, Stasys
ISBN 10: 3642173632 ISBN 13: 9783642173639
Editorial: Springer, 2011
Nuevos
Encuadernación de tapa dura
Librería:
Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 30 de agosto de 2024
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
SUPER FAST SHIPPING. N° de ref. del artículo 9783642173639
Sinopsis:
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.
Acerca del 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Extremal Combinatorics: With Applications in...
Editorial: Springer
Año de publicación: 2011
Encuadernación: Encuadernación de tapa dura
Condición: New
Edición: 2ª Edición
Los mejores resultados en AbeBooks
Imagen de archivo
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
hardcover. Condición: Very Good. Nº de ref. del artículo: mon0003608472
Comprar usado
EUR 54,49
Gastos de envío:
EUR 4,30
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_432796421
Comprar usado
EUR 56,18
Gastos de envío:
EUR 3,23
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Extremal Combinatorics
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642173632
ISBN 13: 9783642173639
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Gebunden. Condición: 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 ref. del artículo: 5051409
Comprar nuevo
EUR 81,44
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Extremal Combinatorics | With Applications in Computer Science
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Extremal Combinatorics | With Applications in Computer Science | Stasys Jukna | Buch | xxiv | Englisch | 2011 | Springer-Verlag GmbH | EAN 9783642173639 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 107152232
Comprar nuevo
EUR 84,60
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Extremal Combinatorics : With Applications in Computer Science
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 13612177-n
Comprar nuevo
EUR 93,84
Gastos de envío:
EUR 2,27
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020219992
Comprar nuevo
EUR 94,49
Gastos de envío:
EUR 3,44
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Extremal Combinatorics (Hardcover)
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2011
ISBN 10: 3642173632
ISBN 13: 9783642173639
Nuevo
Tapa dura
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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 KruskalKatona theorem on shadows, the LovaszStein 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 Lovasz Local Lemma, Schoening's algorithm for 3-SAT, the SzemerediTrotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783642173639
Comprar nuevo
EUR 96,19
Gastos de envío:
GRATIS
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Extremal Combinatorics : With Applications in Computer Science
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642173632
ISBN 13: 9783642173639
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783642173639
Comprar nuevo
EUR 96,29
Gastos de envío:
EUR 64,08
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Extremal Combinatorics
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642173632
ISBN 13: 9783642173639
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783642173639
Comprar nuevo
EUR 96,29
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Extremal Combinatorics
Publicado por
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642173632
ISBN 13: 9783642173639
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783642173639
Comprar nuevo
EUR 96,29
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles