Randomized Algorithms: Approximation, Generation, And Counting-..
R$ 912,92
até
4x
de
R$ 228,23
sem juros
ou R$ 867,27
via Pix
Adicionar ao carrinho
Disponibilidade: 45 dias úteis
Estoque: 203 unidades
-
- 1x de R$ 912,92 sem juros
- 2x de R$ 456,46 sem juros
- 3x de R$ 304,30 sem juros
- 4x de R$ 228,23 sem juros
-
R$ 867,27
-
R$ 912,92
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.
| ISBN | 9781447111801 |
| Autor(a) | Bubley, Russ |
| Editora | Springer Publishing |
| Ano de edição | 2011 |
| Páginas | 152 |
| Acabamento | Brochura |
| Dimensões | 23,40 X 15,60 |
Produtos relacionados
-
Finite Elements And Approximation-..R$ 165,59R$ 132,47até 2x de R$ 66,23 sem jurosou R$ 125,85 via Pix20% Desconto -
Orthogonal Polynomials: Computation And Approximation-..R$ 2.075,00R$ 1.660,00até 4x de R$ 415,00 sem jurosou R$ 1.577,00 via Pix20% Desconto -
Next Generation Sequencing And Sequence Assembly: Methodologies And Algorithms-..R$ 456,42até 4x de R$ 114,10 sem jurosou R$ 433,60 via Pix -
Functional Gaussian Approximation For Dependent Structures-..R$ 1.328,00R$ 1.062,40até 4x de R$ 265,60 sem jurosou R$ 1.009,28 via Pix20% Desconto
-
Categorias
Pague com
Selos
MYRE EDITORA, COMERCIALIZADORA, IMPORTADORA E DISTRIBUIDORA LTDA - CNPJ: 50.295.718/0001-20 © Todos os direitos reservados. 2026
