Randomized Algorithms

This single book has all you've
been looking for, doesn't it ?

Stop wasting your time !
Get It Now !

Living in Europe? Get It Here!
Living in Deutschland? Get It Here!

by Rajeev Motwani, Prabhakar Raghavan

Our Price: $47.95

Availability: Usually ships within 24 hours.

Customers who bought this book also bought:

Approximation Algorithms for Np-Hard Problems; Dorit S. Hochbaum(Editor)
Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes); Michael George Luby
Computational Complexity; Christos H. Papadimitriou
Computers and Intractability : A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences); Michael R. Garey, David S. Johnson

Reviews
Book Description
For many applications a randomized algorithm is the simplest algorithm available, or the fastest, or both. This book presents basic tools from probability theory used in algorithmic applications, with examples to illustrate the use of each tool in a concrete setting. Several important areas of application of randomized algorithms are explored in detail, giving a representative selection of the algorithms in these areas. Although written primarily as a text, this book should also prove invaluable as a reference for professionals and researchers.

Back to General
Back to Algorithms
Back to Main Index