Extracting randomness: A survey and new constructions

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 148-173

  Nisan, Noam ^a   Ta Shma, Amnon ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; RANDOM PROCESSES;

DISPENSERS; EXTRACTORS;

BOOLEAN FUNCTIONS;

EID: 0033075850     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1546     Document Type: Article

References (41)

1. N. Alon, O. Goldreich, J. Hastad, and Peralta, Simple constructions of almost k-wise independent random variables, Random Struct. and Algorithms 3 (1992).
2. M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic simulation in LOGSPACE, in "ACM Symposium on Theory of Computing (STOC), 1987."
3. M. Ajtai, J. Komlos, W. Steiger, and E. Szemeredi, Almost sorting in one round, Adv. Comput. Res. 5 (1989), 117-125.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proceedings, 33rd Annual IEEE Symposium on the Foundations of Computer Science IEEE, 1992," pp. 14-23.
5. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
6. S. Arora and S. Safra, Probabilistic checking of proofs; a new characterization of NP, in "Proceedings, 33rd Annual IEEE Symposium on the Foundations of Computer Science, 1992," pp. 2-13.
7. M. Blum, Independent unbiased coin flips from a correlated biased source: A finite Markov chain, Combinatorica 6(2) (1986), 97-108.
8. Bellare and Rompel, Randomness-efficient oblivious sampling, in "IEEE Symposium on Foundations of Computer Science (FOCS), 1994."
9. B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput. 17(2) (1988), 230-261.
10. B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity 5 (1989).
11. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, The bit extraction problem and t-resilient functions, in "Proceedings, 26th Annual IEEE Symposium on the Foundation of Computer Science, 1985," pp. 396-407.
12. A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources, in "Proceedings, 30th Annual IEEE Symposium on the Foundation of Computer Science, 1989," pp. 14-19.
13. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete, in "Proceedings, 32nd Annual IEEE Symposium on the Foundation of Computer Science, IEEE, 1991," pp. 2-12.
14. Gabber and Galil, Explicit constructions of linear-sized superconcentrators, J. Comput. and System Sci. 22 (1981).
15. O. Goldreich and A. Wigderson, Tiny families of functions with random properties: A quality-size trade-off for hashing, in "Proceedings, 26th Annual ACM Symposium on the Theory of Computing, ACM, 1994," pp. 574-583.
16. R. Impagliazzo, L. Levin, and M. Luby, Pseudo-random generation from one-way functions, in "Proceedings, 21st Annual ACM Symposium on the Theory of Computing, ACM, 1989," pp. 12-24.
17. R. Impagliazzo and D. Zuckerman, How to recycle random bits, in "Proceedings, 30th Annual IEEE Symposium on the Foundation of Computer Science, IEEE, 1989," pp. 248-253.
18. Liechtenstein, Linial, and Saks, Some extremal problems arising from discrete control processes, Combinatorica 9 (1989).
19. R. Meshulam, A geometric construction of a superconcentrator of depth 2, Theor. Comput. Sci. 32 (1984), 215-219.
20. Rajeev Motwani and Prabhakar Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, 1995.
21. N. Nisan, Refining randomness: Why and how, in "Annual Conference on Structure in Complexity Theory, 1996."
22. Naor and Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput. 22 (1993).
23. N. Nisan and D. Zuckerman, More deterministic simulation in logspace, in "Proceedings, 25st Annual ACM Symposium on the Theory of Computing, ACM, 1993," pp. 235-244.
24. N. Pippenger, Superconcentrators, SIAM J. Comput. (1977).
25. N. Pippenger, Superconcentrators of depth 2, J. Comput. System Sci. 24 (1982).
26. N. Pippenger, Sorting and selecting in rounds, SIAM J. Comput. 16 (1987), 1032-1038.
27. N. Pippenger, Sorting and selecting in rounds, SIAM J. Comput. 16 (1987), 1032-1038.
28. Sipser, Expanders, randomness, or time versus space, J. Comput. and System Sci. 36 (1988).
29. M. Saks, A. Srinivasan, and S. Zhou, Explicit dispersers with polylog degree, in "Proceedings, 26th Annual ACM Symposium on the Theory of Computing, ACM, 1995."
30. M. Santha and U. Vazirani, Generating quasi-random sequences from slightly random sources, J. Comput. System Sci. 33 (1986), 75-87.
31. A. Srinivasan and D. Zuckerman, Computing with very weak random sources, in "Proceedings, 35th Annual IEEE Symposium on the Foundations of Computer Science, IEEE, 1994."
32. A. Ta-Shma, On extracting randomness from weak random sources, in "ACM Symposium on Theory of Computing (STOC), 1996."
33. U. Vazirani, "Randomness, Adversaries and Computation," Ph.D. thesis, University of California, Berkeley, 1986.
34. U. Vazirani, Efficiency considerations in using semi-random sources, in "Proceedings, 19th Annual ACM Symposium on the Theory of Computing, ACM, 1987," pp. 160-168.
35. U. Vazirani, Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Combinatorica 7(4) (1987), 375-392.
36. U. Vazirani and V. Vazirani, Random polynomial time is equal to slightly-random polynomial time, in "Proceedings, 26th Annual IEEE Symposium on the Foundations of Computer Science, IEEE, 1985," pp. 417-428.
37. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: Explicit construction and applications, in "Proceedings, 25th Annual ACM Symposium on the Theory of Computing, ACM, 1993," pp. 245-251.
38. D. Zuckerman, Randomness-optimal sampling, extractors, and constructive leader election, private communication.
39. D. Zuckerman, General weak random sources, in "Proceedings, 31st Annual IEEE Symposium on the Foundation of Computer Science, 1990," pp. 534-543.
40. D. Zuckerman, Simulating BPP using a general weak random source, in "Proceedings, 32nd Annual IEEE Symposium on the Foundations of Computer Science, IEEE, 1991," pp. 79-89.
41. D. Zuckerman, NP-complete problems have a version that is hard to approximate, in "Proceedings, 8th Structures in Complexity Theory, IEEE, 1993," pp. 305-312.