Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Randomized Algorithms: Approximation, Generation, and Counting
Angličtina
249 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
31.84
€
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.
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ť
/
Pevná
822.97
€
/
Pevná
111.42
€
/
Brožovaná
13.24
€
/
Brožovaná
32.75
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?