Książka Randomized Algorithms: Approximation, Generation, and Counting Russ Bubley

Randomized Algorithms: Approximation, Generation, and Counting

Autor: Russ Bubley
Język: Angielski
Oprawa: Miękka
Dostępność: Dostępna u dostawcy
Wysyłamy za 5-8 dni
423.12
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of whic...

Informacje o książce

Autor
Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2011
strony
152
EAN
9781447111801
ISBN
144711180X
Enbook ID
06794617
Waga
277
Wymiary
155 x 235 x 10

Pełny opis

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.

Możesz być zainteresowany

Much Ado About Nothing

William Shakespeare
27.71

Dal-Junker

MORITZ REICHENBACH
133.74
46.19
37.54

Pawnee Music

Frances Densmore
102.90

Very British

Gerhard Grubbe
69.93

STRAY CAT & WOLF V01

Miyuki Mitsubachi
56.41

Throne of Secrets

Kerri Maniscalco
37.54
106.80
471.86
140.94

Words I Spoke

Alan Hines
50.09

300 Best Taco Recipes

Kelley Cleary Coffeen
93.86

Klienci, którzy kupili tę książkę, kupili również

93.76
151.25
76.54
81.31
62.83
123.62
92.50

Bakaschmars Fluch

Claudia Lederer
467.38

Linguística:

Rosangela Nieto de Albuquerque
121.09