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

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
Editor: Springer
Fecha de publicaci�n: 2011
Idioma: Ingl�s
ISBN 10: 3642173632
ISBN 13: 9783642173639
Encuadernaci�n: hardcover
Edici�n: 2� Edici�n
Estado: Good

Acerca de

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.