Randomized Algorithms: Approximation, Generation, and Counting

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

Автор: Russ Bubley

Език:

Корици: С меки корици

Издател: Springer London Ltd

Наличност: Външен склад

Изпращаме след 5-8 дни

105.32 € 205.99 лв

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

Информация за книгата

Автор

Russ Bubley

Език

Английски език

Корици

Книга - С меки корици

Издадена

2011

страници

152

EAN

9781447111801

ISBN

144711180X

Enbook ID

06794617

Издател

Springer London Ltd

Теглоt

277

Размери

155 x 235 x 10

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Randomized Algorithms: Approximation, Generation, and Counting

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също