A new general derandomization method

Journal of the ACM

Volumn 45, Issue 1, 1998, Pages 179-213

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

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Algorithms; BPP; F.2.2 Analysis of Algorithms and Problem Complexity : Nonnumerical Algorithms and Problems computations on discrete structures; G.3 Mathematics of Computing : Probability and Statistics probabilistics algorithms; Theory

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; POLYNOMIALS; PROBABILISTIC LOGICS; RANDOM NUMBER GENERATION; SET THEORY; THEOREM PROVING;

DERANDOMIZATION METHODS; QUICK HITTING SET GENERATORS;

RANDOM PROCESSES;

EID: 0031677538     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/273865.273933     Document Type: Article

References (19)

1. ANDREEV, A., BASKAKOV, J., CLEMENTI, A., AND ROLIM, J. 1997a. Small random sets for affine spaces and better explicit lower bounds for branching programs. ECCC, TR97-053.
2. ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1996. Hitting properties of hard Boolean operators and their consequences on BPP. ECCC, TR96-055.
3. ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1997b. Efficient constructions of hitting sets for systems of linear functions. In Proceedings of the XIV Annual Symposium on the Theoretical Aspects of Computer Science (STACS'97). Lecture Notes in Computer Science, vol. 1200. Springer-Verlag, New York, pp. 357-368 (also available in ECCC as TR96-029).
4. ANDREEV, A., CLEMENTI, A., AND ROLIM, J. 1997c. Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs. In Proceedings of the 24th Annual International Colloquium on Algorithms, Logic and Programming (ICALP'97). Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 177-187.
5. ANDREEV, A., CLEMENTI, A., ROLIM, J., AND TREVISAN, L. 1997d. Weak random sources, hitting sets, and BPP simulation. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 264-273. (Full version to appear in SIAM J. Comput.)
6. ANDREEV, A., CLEMENTI, A., ROLIM, J., AND TREVISAN, L. 1997d. Weak random sources, hitting sets, and BPP simulation. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 264-273. (Full version to appear in SIAM J. Comput.)
7. BELLARE, M., AND ROMPEL, J. 1994. Randomness-efficient oblivious sampling. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 276-287.
8. BLUM, M., AND MICALI, S. 1984. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13, 4, 850-864.
9. CHOR, B., AND GOLDREICH, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2, 230-261.
10. GOLDREICH, O. 1997. A sample of samplers: A computational perspective on sampling. In Electronic Colloquium on Computational Complexity (ECCC). TR97-20.
11. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
12. NISAN, N. 1990. Using hard problems to create pseudorandom generators, ACM distinguished dissertation. MIT Press, Cambridge, Mass.
13. NISAN, N. 1996. Exacting randomness: How and why. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity. IEEE, New York, pp. 44-58.
14. NISAN, N., AND WIGDERSON, A. 1994. Hardness vs. randomness. J. Comput. Syst. Sci. 49, 149-167.
15. PAPADIMITRIOU, C. H. 1993. Computational Complexity. Addison-Wesley, Reading, Mass.
16. SAKS, M., SRINIVASAN, A., AND ZHOU, S. 1998. Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 1 (Jan.), 123-154.
17. WEGENER, I. 1987. The Complexity of Finite Boolean Functions. Wiley-Teubner Series in Computer Science. Wiley, New York.
18. TA-SHMA, A. 1996. On extracting randomness from weak random sources. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 276-285.
19. YAO, A. 1982. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations on Computer Science. IEEE, New York, pp. 80-91.