Extracting all the randomness and reducing the error in Trevisan's extractors

Journal of Computer and System Sciences

Volumn 65, Issue 1, 2002, Pages 97-128

  Raz, Ran ^a   Reingold, Omer ^b   Vadhan, Salil ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b AT AND T LABS RESEARCH   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Combinatorial designs; Expander graphs; Extractors; Probabilistic method; Pseudorandom generators

Indexed keywords

ENTROPY; GRAPH THEORY; LINEAR SYSTEMS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; RANDOM PROCESSES; STATISTICAL METHODS;

COMBINATORIAL DESIGNS; EXPANDER GRAPHS; EXTRACTORS; PROBABILISTIC METHODS; PSEUDORANDOM GENERATORS;

ERROR ANALYSIS;

EID: 0038309373     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1824     Document Type: Conference Paper

References (55)

1. [AKSS89] M. Ajtai, J. Komlós, W. Steíger, and E. Szemerédi, Almost sorting in one round, in "Randomness and Computation" (S. Micali, Ed.), Advances in Computing Research, Vol. 5, pp. 117-125, JAI Press, 1989.
2. [AS00] N. Alon and J. H. Spencer, "The Probabilistic Method," Interscience Series in Discrete Mathematics and Optimization, 2nd ed., Wiley, New York, 2000.
3. [ACR97] A. E. Andreev, A. E. F. Clementi, and J. D. P. Rolim, Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs, in "Automata, Languages and Programming, 24th International Colloquium, Bologna, Italy, 7-11 July 1997" (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 177-187, Springer-Verlag, Berlin/New York.
4. [BGS98] M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs, and nonapproximabilitytowards tight results, SIAM J. Comput. 27 (1998), 804-915.
5. [CG88] B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput. 17 (1988), 230-261.
6. [CW89] A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources (extended abstract), in "30th Annual Symposium on Foundations of Computer Science Research Triangle Park, NC, 30 October-1 November 1989," pp. 14-19, IEEE Comput. Soc. Press, Los Alamitos, CA.
7. [CT91] T. M. Cover and J. A. Thomas, "Elements of Information Theory," Wiley Series in Telecommunications, 2nd ed., Wiley, New York, 1991.
8. [EFF85] P. Erdös, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math. 51 (1985), 79-89.
9. [GRS00] O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: The highly noisy case, SIAM J. Discrete Math. 13 (2000).
10. [GW97] O. Goldreich and A. Wigderson, Tiny families of functions with random properties: A quality-size trade-off for hashing, Random Structures Algorithms 11 (1997), 315-343.
11. [GZ97] O. Goldreich and D. Zuckerman, Another proof that BPP S PH (and more), "Electronic Colloquium on Computational Complexity," Technical Report TR97-045, September 1997. Available at http://www.eccc.uni-trier.de/eccc.
12. [HR00] T. Hartman and R. Raz, On the distribution of the number of roots of polynomials and explicit logspace extractors, in "Proceedings of RANDOM 2000," Proceedings in Informatics, Vol. 8, Carleton Scientific, 14 July 2000.
13. [ILL89] R. Impagliazzo, L. A. Levin, and M. Luby, Pseudo-random generation from one-way functions (extended abstracts), in "Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, WA, 15-17 May 1989," pp. 12-24.
14. [ISW00] R. Impagliazzo, R. Shaltiel, and A. Wigderson, Extractors and pseudo-random generators with optimal seed length, in "Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, 21-23 May 2000," pp. 1-10.
15. [IW96] R. Impagliazzo and A. Wigderson, An information theoretic variant of the inclusion-exclusion bound (preliminary version), unpublished manuscript, September 1996.
16. [IW97] R. Impagliazzo and A. Wigderson, P = BPP if E requires exponential circuits: Derandomizing the XOR lemma, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, 4-6 May 1997," pp. 220-229.
17. [MS77] F. J. MacWilliams and N. J. A. Sloane, "The Theory of Error-Correcting Codes," North-Holland, Amsterdam, 1977.
18. [MR95] R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
19. [Nis96] N. Nisan, Extracting randomness: How and why: A survey, in "Proceedings, Eleventh Annual IEEE Conference on Computational Complexity, Philadelphia, PA, 24-27 May 1996," pp. 44-58, IEEE Comput. Soc. Press, Los Alamitos, CA.
20. [NT98] N. Nisan and A. Ta-Shma, Extracting randomness: A survey and new constructions, J. Comput. System Sci.
21. [To appear in STOC '96 special issue. Preliminary versions in [Nis96] and [Ta-96]]
22. [NW94] N. Nisan and A. Wigderson, Hardness vs randomness, J. Comput. System Sci. 49 (1994), 149-167.
23. [NZ96] N. Nisan and D. Zuckerman, Randomness is linear in space, J. Comput. System Sci. 52 (1996), 43-52.
24. [Pip87] N. Pippenger, Sorting and selecting in rounds, SIAM J. Comput. 16 (1987), 1032-1038.
25. [RT97] J. Radhakrishnan and A. Ta-Shma, Tight bounds for depth-two superconcentrators, in "38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20-22 October 1997," pp. 585-594, IEEE Comput. Soc. Press, Los Alamitos, CA.
26. [RR99] R. Raz and O. Reingold, On recycling the randomness of the states in space bounded computation, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1-4 May 1999," pp. 159-168.
27. [RRV99a] R. Raz, O. Reingold, and S. Vadhan, Error reduction for extractors, in "40th Annual Symposium on Foundations of Computer Science, New York City, New York, 17-19 October 1999," pp. 191-201, IEEE Comput. Soc. Press, Los Alamitos, CA.
28. [RRV99b] R. Raz, O. Reingold, and S. Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1-4 May 1999," pp. 149-158.
29. [RRV99c] R. Raz, O. Reingold, and S. Vadhan, "Extracting all the randomness and reducing the error in Trevisan's extractors," Technical Report TR99-046, Electronic Colloquium on Computational Complexity, 1999. Available at http://www.eccc.uni-trier.de/eccc.
30. [RSW00] O. Reingold, R. Shaltiel, and A. Wigderson, Extracting randomness via repeated condensing, in "41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 17-19 October 2000," pp. 22-31, IEEE Comput. Soc. Press, Los Alamitos, CA.
31. [RVW00] O. Reingold, S. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, in "41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 17-19 October 2000," pp. 3-13, IEEE Comput. Soc. Press, Los Alamitos, CA.
32. [Röd85] V. Rödl, On a packing and covering problem, Europ. J. Combinatorics 6 (1985), 69-78.
33. [RZ98] A. Russell and D. Zuckerman, Perfect information leader election in log* n + o(1) rounds, in "39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 8-11 November 1998," IEEE Comput. Soc. Press, Los Alamitos, CA.
34. [SSZ98] M. Saks, A. Srinivasan, and S. Zhou, Explicit OR-dispersers with polylogarithmic degree, J. Assoc. Comput. Mach. 45 (1998), 123-154.
35. [SV86] M. Santha and U. V. Vazirani, Generating quasi-random sequences from semi-random sources, J. Comput. System Sci. 33 (1986), 75-87.
36. [Sip88] M. Sipser, Expanders, randomness, or time versus space, J. Comput. System Sci. 36 (1988), 379-383.
37. [SZ98] A. Srinivasan and D. Zuckerman, Computing with very weak random sources, SIAM J. Comput., in press.
38. [Preliminary version in FOCS '94.]
39. [STV99] M. Sudan, L. Trevisan, and S. Vadhan, Pseudorandom generators without the XOR lemma, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1-4 May 1999," pp. 537-546.
40. [In joint session with Complexity '99.]
41. [Ta-96] A. Ta-Shma, On extracting randomness from weak random sources (extended abstract), in "Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, 22-24 May 1996," pp. 276-285.
42. [TS98] A. Ta-Shma, personal communication, August 1998.
43. [Ta-98] A. Ta-Shma, Almost optimal dispersers, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, May 1998," pp. 196-202, Assoc. Comput. Mach., New York.
44. [TUZ01] A. Ta-Shma, C. Umans, and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in "Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001," to appear.
45. [Tre99] L. Trevisan, Construction of extractors using pseudo-random generators, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1-4 May 1999," pp. 141-148.
46. p minimization problems, in "40th Annual Symposium on Foundations of Computer Science, New York City, New York, 17-19 October 1999," pp. 465-474, IEEE Comput. Soc. Press, Los Alamitos, CA.
47. [Vaz84] U. V. Vazirani, "Randomness, Adversaries, and Computation," Ph.D. thesis, University of California, Berkeley, 1984.
48. [Vaz87a] U. V. Vazirani, Efficiency considerations in using semi-random sources (extended abstract), in "Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York City, 25-27 May 1987," pp. 160-168.
49. [Vaz87b] U. V. Vazirani, Strong communication complexity or generating quasirandom sequences from two communicating semirandorn sources, Combinatorial 1 (1987), 375-392.
50. [W85] U. V. Vazirani and V. V. Vazirani, Random polynomial time is equal to slightly-random polynomial time, in "26th Annual Symposium on Foundations of Computer Science, Portland, OR, 21-23 October 1985," pp. 417-428, IEEE Comput. Soc. Press, Los Alamitos, CA.
51. [Weg87] I. Wegener, "The Complexity of Boolean Functions," Wiley-Teubner Series in Computer Science, Wiley, New York, 1987.
52. [WZ99] A. Wigderson and David Zuckerman, Expanders that beat the eigenvalue bound: Explicit construction and applications, Combinatorica 19 (1999), 125-138.
53. [Yao82] A. C. Yao, Theory and applications of trapdoor functions (extended abstract), in "23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, 3-5 November 1982," pp. 80-91, IEEE Comput. Soc. Press, Los Alamitos, CA.
54. [Zuc96] D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica 16 (1996), 367-391.
55. [Zuc97] D. Zuckerman, Randomness-optimal oblivious sampling, Random Structures Algorithms 11 (1997), 345-367.