Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) (1996)
May 24, 1996 to May 27, 1996
Noam Nisan , Institute of Computer Science Hebrew University Jerusalem, Israel
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.
Randmoness, Computational Complexity, Expanders, Derandomization
N. Nisan, "Extracting Randomness: How and Why - A survey," Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)(CCC), Philadelphia, PA, 1996, pp. 44.