Code: 01566695
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 m ... more
English
103.05 €
RRP: 111.69 €
You save 8.63 €

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 Mathematics & science Mathematics Combinatorics & graph theory
103.05 €
English
Collection points Bratislava a 12863 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25730 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )