ENGLISH

Randomized algorithms

By Rajeev Motwani , Prabhakar Raghavan

Book information

Publisher
Cambridge University Press
Year
1995
ISBN
9780521474658, 0-521-47465-5
LCC
QA274 .M68 1995
Open Library ID
OL1118069M
Language
english
Format
DJVU
Filesize
5 MB (5518098 bytes)
Pages
487\487
Library
mexmat
Time added
2009-07-20 03:45:11

Description

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.

Similar books