Contacto
Como comprar
Entrega
Guia de compras
Randomized Algorithms: Approximation, Generation, and Counting
Inglês
222 b
Política de devolução de 30 dias
Os clientes também compraram
/
Capa mole
28.62
€
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.
Sobre o livro
Inglês
Categorias
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Livro de capa dura
751.95
€
/
Livro de capa dura
95.60
€
/
Capa mole
11.52
€
/
Capa mole
29.43
€
