Kniha Randomized Algorithms: Approximation, Generation, and Counting Russ Bubley

Randomized Algorithms: Approximation, Generation, and Counting

Autor: Russ Bubley
Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: Springer London Ltd
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
2 286
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of whic...

Informace o knize

Autor
Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2011
Stránek
152
EAN
9781447111801
ISBN
144711180X
Enbook ID
06794617
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

Much Ado About Nothing

William Shakespeare
149

Dal-Junker

MORITZ REICHENBACH
728
251
202

Pawnee Music

Frances Densmore
559

Very British

Gerhard Grubbe
378

STRAY CAT & WOLF V01

Miyuki Mitsubachi
327

Throne of Secrets

Kerri Maniscalco
200
764

Words I Spoke

Alan Hines
273

300 Best Taco Recipes

Kelley Cleary Coffeen
506

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

505
424
337
742
529

Bakaschmars Fluch

Claudia Lederer
2 514

Linguística:

Rosangela Nieto de Albuquerque
651