Randomized Algorithms

Author: Rajeev Motwani, Prabhakar Raghavan
List Price: $60.00
Our Price: Click to see the latest and low price
ISBN: 0521474655
Publisher: Cambridge University Press (25 August, 1995)
Edition: Hardcover
Sales Rank: 40,140
Average Customer Rating: 4.5 out of 5

Buy now directly from Amazon.com - Purchase this book, safely and securely from the largest book dealer on the Internet, Amazon.com

Customer Reviews

Rating: 5 out of 5
A subtle introduction to probablistic algoritms
This book is a jewel. It demonstrates how clever and beautifully simple probabilistic ideas can lead to the design of very efficient algorithms. I like its very verbal intuitive style,
with proof strategies being always transparently explained.
For computer scientists, this is *the* reference work in randomized algorithms, by now a major paradigm of algorithms design. For classical probabilists, this
could serve as an eye-opener on unsuspected applications of their field to important areas of computer science.


Rating: 4 out of 5
An enciclopedia for randomized algorithms.
The book has an exoustive amount of algorithms. Not everything is proved. Sometimes the proof contains to few steps to be understood. There are many algorithms explained well. After reading this book it is easy to create your own randomized algorithms.


Rating: 4 out of 5
extremely informative but obscure
I've taken two CS classes that use this book and I always felt like this book was very informative. The algorithms and concepts that Motwani brings forth are extremely insightful and interesting. However, the presentation of the proofs has a lot of room for improvement. Notation is carried over from previous chapters and is sometimes unexplained, which makes it very difficult for someone who does not have a lot of familiarity with the material presented. The book presents very interesting topics and leaves a lot of open (unresolved) questions to the reader's curiosity and challenge.

Similar Products

· Approximation Algorithms for NP-Hard Problems
· Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences)
· Approximation Algorithms

Return To Main Computer Book IndexSearch Our Entire Computer Book Catalog