Randomized Algorithms - Rajeev Motwani, Prabhakar Raghavan
Cambridge University Press (1995)
In Collection

Read It:

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

Product Details
LoC Classification QA274.M68 1995
Dewey 004.015192
Format Hardcover
Cover Price 72,00 €
No. of Pages 492
Height x Width 257 x 178 mm
Personal Details
Links Amazon