Autorenfreundlich Bücher kaufen?!
Beschreibung
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.
Details
| Verlag | Springer London |
| Ersterscheinung | 16. September 2011 |
| Maße | 23.5 cm x 15.5 cm |
| Gewicht | 277 Gramm |
| Format | Softcover |
| ISBN-13 | 9781447111801 |
| Auflage | Softcover reprint of the original 1st edition 2001 |
| Seiten | 152 |
Schlagwörter
Algorithmen und Datenstrukturen, Algorithms, Computerprogrammierung und Softwareentwicklung, Mathematical Applications in Computer Science, Mathematik für Informatiker, Probability Theory, Programming Techniques, Stochastik, Symbolic and Algebraic Manipulation, Theoretische Informatik, Theory of Computation, Wahrscheinlichkeitsrechnung und Statistik
Herstellerinformationen
Bekannt durch
