In-place Algorithm - Role of Randomness

Role of Randomness

In many cases, the space requirements for an algorithm can be drastically cut by using a randomized algorithm. For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph. There is no known simple, deterministic, in-place algorithm to determine this, but if we simply start at one vertex and perform a random walk of about 20n3 steps, the chance that we will stumble across the other vertex provided that it's in the same component is very high. Similarly, there are simple randomized in-place algorithms for primality testing such as the Miller-Rabin primality test, and there are also simple in-place randomized factoring algorithms such as Pollard's rho algorithm. See RL and BPL for more discussion of this phenomenon.

Read more about this topic:  In-place Algorithm

Famous quotes containing the words role of and/or role:

    But however the forms of family life have changed and the number expanded, the role of the family has remained constant and it continues to be the major institution through which children pass en route to adulthood.
    Bernice Weissbourd (20th century)

    Totalitarianism is never content to rule by external means, namely, through the state and a machinery of violence; thanks to its peculiar ideology and the role assigned to it in this apparatus of coercion, totalitarianism has discovered a means of dominating and terrorizing human beings from within.
    Hannah Arendt (1906–1975)