A Suvey of Randomness and Randomness Extractors

Randomness extractors are functions that"extract"(almost uniformly distributed)random bits from arbitrary distributions that"contain"sufficient randomness.Explicit constructions of randomness extractors have many applications in complexity theory and combinatorics.This paper is a survey of recent developments in the area.