In recent times, probabilistic methods have become increasingly used in the design and analysis of algorithms. On the one hand, they have been applied to the analysis of the average case complexity of deterministic exact or approximate algorithms. On the other hand, (pseudo-)random number generators can be incorporated into an algorithm, in such a way that the algorithm will answer correctly with a reasonably high probability. These are called probabilistic, or randomized, algorithms.
Unable to display preview. Download preview PDF.