Randomized Algorithms: Approximation, Generation, and Counting

Name: Randomized Algorithms: Approximation, Generation, and Counting
Brand: Springer London Ltd
SKU: 9781447111801
Price: 2286 CZK
Availability: InStock

Autor: Russ Bubley

Jazyk:

Vazba: Brožovaná

Vydavatel: Springer London Ltd

Dostupnost: Skladem u dodavatele

Odesíláme za 5-8 dnů

2 286 Kč

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of whic...

Informace o knize

Autor

Russ Bubley

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2011

Stránek

152

EAN

9781447111801

ISBN

144711180X

Enbook ID

06794617

Vydavatel

Springer London Ltd

Hmotnost

277

Rozměry

155 x 235 x 10

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Randomized Algorithms: Approximation, Generation, and Counting

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také