Abstract
This text is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before using it to study a range of randomized algorithms with important applications in optimization and other problems in computing. The book will appeal not only to mathematicians, but to students of computer science who will discover much useful material. This clear and concise introduction to the subject has numerous exercises that will help students to deepen their understanding.
Cite
CITATION STYLE
Talay, D. (2003). Book Review: Finite Markov chains and algorithmic applications. Mathematics of Computation, 72(243), 1573–1576. https://doi.org/10.1090/s0025-5718-03-01604-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.