You might also like

More about Probabilistic Methods for Algorithmic Discrete Mathematics

• Book details
• Synopsis
• Trending among others

You get 249 loyalty points

Book synopsis

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

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

• Full title: Probabilistic Methods for Algorithmic Discrete Mathematics
• Author: Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed
• Language: English
• Binding: Paperback
• Number of pages: 325
• EAN: 9783642084263
• ISBN: 3642084265
• ID: 01653437
• Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Weight: 500 g
• Dimensions: 234 × 157 × 16 mm
• Date of publishing: 18. August 2010

Trending among others

---

---

---