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 item extremal combinatorics with applications in computer science texts in theoretical computer science by stasys jukna hardcover 8878 only 6 left in stock order soon ships from and sold by amazoncom. Substantial space is devoted to the more modern linear algebra and probabilistic methods algorithmic aspects permeate the book making it suitable for a computer science or joint math computer science course there are numerous exercises j spencer mathematical reviews issue 2003 g extremal combinatorics is a part of finite mathematics. To obtain a bound in the general case we employ the entropy argument which by now is widely used in extremal combinatorics 20 40 58 in fact friedgut 26 proved theorem 41 using an entropy . Extremal combinatorics with applications in computer science texts in theoretical computer science an eatcs series by stasys jukna isbn 13 9783642173639 isbn 10 3642173632
How it works:
1. Register Trial Account.
2. Download The Books as you like ( Personal use )