High Quality Content by WIKIPEDIA articles! A randomized algorithm or probabilistic algorithm is an algorithm which employs a degree of randomness as part of its logic. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random bits. Formally, the algorithm's performance will be a random variable determined by the random bits; thus either the running time, or the output (or both) are random variables. In both cases, random performance and random output, the term "algorithm" for a procedure is somewhat questionable, as it is no longer formally effective. However, in some cases, probabilistic algorithms are the only practical means of solving a problem.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.