Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Probabilistic Methods for Algorithmic Discrete Mathematics
Angličtina
249 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
15.70
€
/
Brožovaná
27.86
€
/
Brožovaná
26.04
€
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
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
27.15
€
/
Brožovaná
13.87
€
