.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Extremal Combinatorics: With Applications in Computer Science
Stasys Jukna
€ 119.07
FREE Delivery in Ireland
Description for Extremal Combinatorics: With Applications in Computer Science
Hardcover. 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. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 412 pages, biography. BIC Classification: PBC; PBKS; PBV; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 23. Weight in Grams: 812.
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 ... Read more
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 ... Read more
Product Details
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Format
Hardback
Publication date
2011
Series
Texts in Theoretical Computer Science: An EATCS Series
Condition
New
Weight
811 g
Number of Pages
412
Place of Publication
Berlin, Germany
ISBN
9783642173639
SKU
V9783642173639
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Stasys Jukna
The author is a professor at the Goethe Universitat 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.
Reviews for Extremal Combinatorics: With Applications in Computer Science
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 ... Read more