Mohlo by sa vám tiež páčiť

Viac informácií o knihe Randomized Algorithms: Approximation, Generation, and Counting

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 249 bodov

Anotácia 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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: Randomized Algorithms: Approximation, Generation, and Counting
• Autor: Russ Bubley
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 152
• EAN: 9781447111801
• ISBN: 144711180X
• ID: 06794617
• Nakladateľ: Springer London Ltd
• Hmotnosť: 277 g
• Rozmery: 235 × 155 × 10 mm
• Dátum vydania: 16. September 2011

Obľúbené z iného súdka

---

---

---