BibTeX
@MISC{Motwani95randomizedalgorithms,
author = {Rajeev Motwani},
title = {Randomized Algorithms},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from
