Contact
How to shop
Delivery
Shopping guide
Probabilistic Methods for Algorithmic Discrete Mathematics
English
271 b
30-day return policy
Customers also purchased
/
Paperback
10 524
Ft
/
Paperback
9 013
Ft
/
Paperback
9 715
Ft
/
Paperback
14 878
Ft
The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications- an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms- a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods)- a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph- a succinct treatment of randomized algorithms and derandomization techniques
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
13 833
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?