Randomized algorithms

Randomized algorithms The last decade has witnessed a tremendous growth in the area of randomized algorithms. During this period, randomized algorithms went from being a tool in computational number theory to finding widespread application in many types of algorithms. Two benefits of randomization have spearheaded this growth: simplicity and speed. For many applications, a randomized algorithm is the simplest algorithm available, or the fastest, or both. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area.

Authors: Motwani R., Raghavan P.Pages: 487     Year: 1995

Tags: algorithms randomized raghavan motwani
   

Customers who bought this item also bought:



Dleex

© 2007–2019 Dleex.

English      German      French      Russian

For any question please write to our email e-mail