Extracting randomness: how and why. A survey
Author:
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 44-58
Abstract
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions. Extractors, and the closely related "Dispersers", exhibit some of the most "random-like" properties of explicitly constructed combinatorial structures. In turn, extractors and dispersers have many applications in "removing randomness" in various settings and in making randomized constructions explicit. This manuscript surveys extractors and dispersers: what they are, how they can be designed, and some of their applications. The work described is due to of a long list of research papers by various authors-most notably by David Zuckerman.Keywords
This publication has 31 references indexed in Scilit:
- NP-complete problems have a version that's hard to approximate2002
- Simulating BPP using a general weak random source2002
- General weak random sources2002
- Expanders That Beat the Eigenvalue Bound: Explicit Construction and ApplicationsCombinatorica, 1999
- Randomness-optimal sampling, extractors, and constructive leader election1996
- On the power of two-point based samplingJournal of Complexity, 1989
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sourcesCombinatorica, 1987
- Efficiency considerations in using semi-random sources1987
- The bit extraction problem or t-resilient functions1985
- Random polynomial time is equal to slightly-random polynomial time1985