Randomized Algorithms

Randomized Algorithms
QKVY4mDivBEC
476
By:"Rajeev Motwani","Prabhakar Raghavan"
"Computers"
Published on 1995-08-25 by Cambridge University Press

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.

READ NOW

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.

This Book was ranked 8 by Google Books for keyword algorithms.

The book is written in enfor NOT_MATURE

Read Ebook Now
false
true

Printed Version of this book available in
BOOK

Availability of Ebook version is falsein falseor false

Public Domain Status false

Rating 4.5 by 4

SAMPLE

false

To Get More Computer Engineering Ebooks Click Here