Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Randomized Algorithms: Approximation, Generation, and Counting
Angleščina
236 b
30 dni za vračilo blaga
Drugi so kupili tudi
/
Mehka
31.89
€
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.
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
/
Trda
790.30
€
/
Trda
100.97
€
/
Mehka
13.26
€
/
Mehka
32.81
€
