Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Probabilistic Methods for Algorithmic Discrete Mathematics
Angleščina
252 b
Do 30 dni za vračilo
Drugi so kupili tudi
/
Mehka
9.41
€
/
Mehka
36.17
€
/
Mehka
31.61
€
/
Mehka
26.64
€
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
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Mehka
37.18
€
Pozdravljeni! Sem Libroamiko, vaš knjižni svetovalec.
Kako vam lahko pomagam?