Weak random sources, hitting sets, and BPP simulations

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2103-2116

  Andreev, Alexander E ^a   Clementi, Andrea E F ^b   Rolim, José D P ^c   Trevisan, Luca ^d  

^a AGERE SYSTEMS   (United States)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c UNIVERSITY OF GENEVA   (Switzerland)

^d Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; INFORMATION THEORY; POLYNOMIALS; SET THEORY;

DERANDOMIZATION; EXPANDER GRAPHS; POLYNOMIAL TIME SIMULATION;

RANDOM PROCESSES;

EID: 0033341167     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797325636     Document Type: Article

References (31)

1. A.E. ANDREEV, A.E.F. CLEMENTI, AND J.D.P. ROLIM. A new general de-randomization method, J. ACM, 45 (1998), pp. 179-213.
2. A.E. ANDREEV, A.E.F. CLEMENTI, AND J.D.P. ROLIM, Worst-case hardness suffices for derandomization: A new method for hardness us randomness trade-offs, in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 1256, Springer-Verlag, New York, 1997, pp. 177-187.
3. A.E. ANDREEV, A.E.F. CLEMENTI. J.D.P. ROLIM, AND L. TREVISAN, Weak random sources, hitting sets, and BPP simulations, in Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 264-272.
4. L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
5. M. BLUM AND S. MICALI, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 13 (1984), pp. 850-864.
6. M. BELLARE AND J. ROMPEL, Randomness-efficient oblivious sampling, in Proc. 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 276-287.
7. B. CHOR AND O. GOLDREICH. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17 (1988), pp. 230-261.
8. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 14-19.
9. S. EVEN, A. SELMAN, AND Y. YACOBY, The complexity of promise problems with applications to public-key cryptography, Inform, and Control, 2 (1984), pp. 159-173.
10. O. GOLDREICH, A sample of samplers - A computational perspective on sampling, Electronic Colloquium oil Computational Complexity, 1997, TR97-020.
11. R. IMPAGLIAZZO AND A. WIGDERSON, P= BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proc. 29th ACM Symposium on Theory of Computing, 1997, pp. 220-229.
12. C. LAUTEMANN, BPP and the polynomial hierarchy, Inform. Proc. Lett., 17 (1983), pp. 215-217.
13. M. LI AND P. VITANY, Kolmogorov complexity and its applications, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, New York, 1990, pp. 187-254.
14. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
15. N. NISAN, Using Hard Problems to Create Pseudorandom Generators, ACM Distinguished Dissertations, MIT Press, Cambridge, MA, 1990.
16. N. NISAN, Extracting randomness: How and why, in Proc 11th IEEE Conference on Computational Complexity, 1996, pp. 44-58.
17. N. NISAN AND A. WIGDERSON, Hardness vs randomness, J. Comput System Sci., 49 (1994), pp. 149-167.
18. N. NISAN AND D. ZUCKERMAN, Randomness is linear in space, J. Comput. System Sci., 52 (1996), pp. 43-52.
19. M. SIPSER, A complexity theoretic approach to randomness, in Proc. 15th ACM Symposium on Theory of Computing, 1983, pp. 330-335.
20. M. SAKS, A. SRINIVASAN, AND S. ZHOU, Explicit dispersers with polylog degree, in Proc. 27th ACM Symposium on Theory of Computing, 1995, pp. 479-488.
21. M. SAKS, A. SRINIVASAN, AND S. ZHOU, personal communication, March 1997.
22. M. SANTHA AND U. VAZIRANI. Generating quasi-random sequences from slightly random sources, J. Comput. System Sci., 33 (1986), pp. 75-87.
23. A. SRINIVASAN AND D. ZUCKERMAN, Computing with very weak random sources, in Proc. 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 264-275.
24. A. TA-SHMA, On extracting randomness from weak random sources, in Proc. 28th ACM Symposium on Theory of Computing, 1996, pp. 276-285.
25. U. VAZIRANI, Randomness, Adversaries and Computation, Ph.D. thesis. University of California, Berkeley, CA, 1986.
26. U. VAZIRANI, Efficiency considerations in using semi-random sources, in Proc. 19th ACM Symposium on Theory of Computing, 1987, pp. 160-168.
27. U. VAZIRANI AND V. VAZIRANI, Random polynomial time is equal to slightly random polynomial time, in Proc. 26th IEEE Symposium on Foundations of Computer Science, 1985, pp. 417-428.
28. A.C. YAO, Theory and applications of trapdoor functions, in Proc. 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 80-91.
29. D. ZUCKERMAN, General weak random sources, in Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 534-543.
30. D. ZUCKERMAN, Randomness-optimal sampling, extractors and constructive leader election, in Proc. 28th ACM Symposium on Theory of Computing, 1996, pp. 286-295.
31. D. ZUCKERMAN, Simulating BPP using a general weak random source, Algorithmica, 16 (1996), pp. 367-391.