Code: 06794617
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 "Wha ... more
English
102.73 €
RRP: 111.34 €
You save 8.61 €

You get 249 loyalty points
Book synopsis
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.
Book details
Book category Books in English Computing & information technology Computer science Mathematical theory of computation
102.73 €
English
Collection points Bratislava a 12797 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25598 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )