 | ||||
Author(s): | Olle Häggström | |||
Collection: | London Mathematical Society student texts 52 | |||
Publisher: | Cambridge University Press | |||
Year: | 2002 | |||
Language: | English | |||
Pages: | 123 pages | |||
Size: | 573 KB | |||
Extension: | ||||
[tab]
[content title="Description"]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.
[/content]
[content title="Content"] [/content]
[content title="About the author"]Olle Häggström (born 4 October 1967) is a professor of mathematical statistics at Chalmers University of Technology. Häggström earned his doctorate in 1994 at Chalmers University of Technology with Jeffrey Steif as supervisor.
[/content]
[/tab]
[facebook src="bibliosciencesorg"/]
Key-Words: Télécharger Finite Markov Chains and Algorithmic Applications EBOOK PDF EPUB DJVU. Download Finite Markov Chains and Algorithmic Applications EBOOK PDF EPUB DJVU.
