Randomized Algorithms: Approximation, Generation, and Counting

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

Autor: Russ Bubley

Limbă:

Legare: Carte broșată

Editura: Springer London Ltd

Disponibilitate: În depozitul extern

Expediem în 5-8 zile

553.26 lei

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

Informații despre carte

Autor

Russ Bubley

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2011

Pagini

152

EAN

9781447111801

ISBN

144711180X

Enbook ID

06794617

Editura

Springer London Ltd

Greutate

277

Dimensiuni

155 x 235 x 10

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Randomized Algorithms: Approximation, Generation, and Counting

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și