Mohlo by se vám také líbit

Více informací o knize Randomized Algorithms: Approximation, Generation, and Counting

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 236 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Randomized Algorithms: Approximation, Generation, and Counting
• Autor: Russ Bubley
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 152
• EAN: 9781447111801
• ISBN: 144711180X
• ID: 06794617
• Nakladatelství: Springer London Ltd
• Hmotnost: 277 g
• Rozměry: 235 × 155 × 10 mm
• Datum vydání: 16. September 2011

Oblíbené z jiného soudku

---

---

---