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 survey 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.
| Original language | English |
|---|---|
| Pages (from-to) | 44-58 |
| Number of pages | 15 |
| Journal | Proceedings of the Annual IEEE Conference on Computational Complexity |
| State | Published - 1996 |
| Event | Proceedings of the 1996 11th Annual IEEE Conference on Computational Complexity - Philadelphia, PA, USA Duration: 24 May 1996 → 27 May 1996 |