A Simple Class of Algorithms

Rainer Kemp · 1984

The purpose of this section is to present a well-known class of algorithms, the so-called random algorithms . In practice, many algorithms do not satisfy the strong assumptions of a random algorithm, but analysis of the computation time for algorithms of this kind affords a welcome occasion for introducing some basic definitions.

Read the paper · More papers on PaperTik