Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Probabilistic Methods for Algorithmic Discrete Mathematics
Angličtina
236 b
30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
718
Kč
/
Brožovaná
529
Kč
/
Brožovaná
571
Kč
/
Brožovaná
874
Kč
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
Informace o knize
Angličtina
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
854
Kč
