Extracting randomness: how and why. A survey

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.

[1]  Noga Alon,et al.  Expanders, sorting in rounds and superconcentrators of limited depth , 1985, STOC '85.

[2]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

[3]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[4]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Manuel Blum.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..

[6]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[8]  Nicholas Pippenger,et al.  Superconcentrators of Depth 2 , 1982, J. Comput. Syst. Sci..

[9]  Aravind Srinivasan,et al.  Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[12]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[13]  Nicholas Pippenger,et al.  Sorting and Selecting in Rounds , 1987, SIAM J. Comput..

[14]  Umesh V. Vazirani,et al.  Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..

[15]  Michael Sipser,et al.  Expanders, Randomness, or Time versus Space , 1988, Journal of computer and system sciences (Print).

[16]  Roy Meshulam,et al.  A Geometric Construction of a Superconcentrator of Depth 2 , 1984, Theor. Comput. Sci..

[17]  Miklos Santha,et al.  Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.

[18]  Michael E. Saks,et al.  Some extremal problems arising from discrete control processes , 1989, Comb..

[19]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..

[20]  Amnon Ta-Shma,et al.  On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..

[21]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[22]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[23]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[24]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[26]  David Zuckerman,et al.  Randomness-optimal sampling, extractors, and constructive leader election , 1996, STOC '96.

[27]  Avi Wigderson,et al.  Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.

[28]  David Zuckerman,et al.  NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[29]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  David Zuckerman,et al.  Simulating BPP using a general weak random source , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[31]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

[32]  Aravind Srinivasan,et al.  Explicit dispersers with polylog degree , 1995, STOC '95.

[33]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[34]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[35]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[36]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[37]  Umesh V. Vazirani,et al.  Efficiency considerations in using semi-random sources , 1987, STOC.