Pairwise independence and derandomization

Foundations and Trends in Theoretical Computer Science

Volumn 1, Issue 4, 2006, Pages 237-301

  Luby, Michael ^a   Wigderson, Avi ^b  

^a Digital Fountain Inc   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBABILITY; RANDOM PROCESSES;

ALGORITHM DESIGN; DERANDOMIZATION; PARADIGM; PROBABILISTIC ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 33746626361     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000009     Document Type: Article

References (43)

1. L. Adleman, "Two theorems on random polynomial time," FOCS, pp. 75-83, 1978.
2. 1-Formulae on finite structures," Annals of Pure and Applied Logic, vol. 24, pp. 1-48, 1983.
3. M. Ajtai, J. Komlos, and E. Szemeredi, "Deterministic simulation in LOGSPACE," STOC, p. 132, 1987.
4. W. Alexi, B. Chor, O. Goldreich, and C. Schnorr, "RSA/Rabin functions: Certain parts are as hard as the whole," SIAM J. on Computing, vol. 17, no. 2, pp. 194-209, April 1988.
5. N. Alon, L. Babai, and A. Itai, "A fast and simple randomized parallel algorithm for the maximal independent set problem," Journal of Algorithms, vol. 7, pp. 567-583, 1986.
6. N. Alon and F. R. K. Chung, "Explicit construction of linear sized tolerant networks," Discrete Math, vol. 72, pp. 15-19, 1989.
7. A with probability one," Siam J. on Computing, vol. 10, pp. 96-113, 1981.
8. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudo-random bits," SIAM J. on Computing, vol. 13, pp. 850-864, A preliminary version appears in FOCS, 1982, pp. 112-117, 1984.
9. J. Cai, "With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy," J. of Computer and System Sci., vol. 38, pp. 68-85, A preliminary version appears in STOC, 1986, pp. 21-29, 1989.
10. B. Chor and O. Goldreich, "On the power of two-point sampling," Journal of Complexity, vol. 5, pp. 96-106, 1989.
11. A. Cohen and A. Wigderson, "Dispersers, deterministic amplification, and weak random sources," FOCS, pp. 14-19, 1989.
12. M. Fredman, J. Komlos, and E. Szemeredi, "Storing a sparse table in O(1) worst case access time," Journal of the ACM, vol. 31, pp. 538-544, 1984.
13. M. Furst, J. Saxe, and M. Sipser, "Parity, circuits and the polynomial time hierarchy," FOCS, pp. 260-270, 1981.
14. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," J. of ACM, vol. 33, no. 4, pp. 792-807, A preliminary version appears in FOCS, 1984., 1986.
15. O. Goldreich and L. Levin, "A hard-core predicate for any one-way function," STOC, pp. 25-32, 1989.
16. S. Goldwasser and S. Micali, "Probabilistic encryption," J. of Computer and System Sci., vol. 28, pp. 270-299, A preliminary version appears in STOC, 1982, pp. 365-377., 1984.
17. S. Goldwasser and M. Sipser, "Private coins vs public coins in interactive proof systems," STOC, pp. 59-68, 1986.
18. J. Håstad, Computational limitations for small depth circuits. Ph.D. thesis, 1986. MIT press.
19. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, "A pseudo-random generator from any one-way function," SIAM Journal on Computing, vol. 28, no. 4, pp. 1364-1396, 1999.
20. S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bulletin of the AMS, to appear.
21. R. Impagliazzo, L. Levin, and M. Luby, "A pseudo-random generator from any one-way function," STOC, pp. 12-24, 1989.
22. R. Impagliazzo and D. Zuckerman, "How to recycle random bits," FOCS, pp. 248-253, 1990.
23. R. Karp and M. Luby, "Monte-carlo algorithms for the planar multiterminal network reliability problem," J. of Complexity, vol. 1, pp. 45-64, 1985.
24. R. Karp, M. Luby, and N. Madras, "Monte-carlo approximation algorithms for enumeration problems," J. of Algorithms, vol. 10, no. 3, pp. 429-448, 1989.
25. R. Karp, N. Pippenger, and M. Sipser, "Expanders, randomness, or time versus space," First Annual Conference on Structure in Complexity Theory, pp. 325-329, 1986.
26. M. Karpinski and M. Luby, "Approximating the number of solutions to a GF[2] formula," Journal of Algorithms, vol. 14, no. 2, pp. 280-287, March 1993.
27. A. Lubotzky, R. Phillips, and P. Sarnak, "Explicit expanders and the ramanujan conjectures," STOC, pp. 240-246,
28. (See also: A. Lubotzky, R. Phillips, P. Sarnak. "Ramanujan graphs," Combinatorica, vol. 8, 1988, pp. 261-277)., 1986.
29. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM J. on Computing, vol. 15, no. 4, pp. 1036-1053, November 1986.
30. G. Margulis, "Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators," Problemy Peredachi Informatsii, vol. 24, pp. 51-60, (in Russian). (English translation in Problems of Information Transmission, vol. 24, 1988, pp. 39-46)., 1988.
31. N. Nisan, "Pseudorandom bits for constant depth circuits," Combinatorica, vol. 1, pp. 63-70, 1991.
32. N. Nisan, "RL⊆SC," STOC, pp. 619-623, 1992.
33. N. Nisan and A. Wigderson, "Hardness vs. randomness," J. of Comp. Sci. and Sys., vol. 49, no. 2, pp. 149-167, 1994.
34. N. Nisan and D. Zuckerman, "More deterministic simulation in logspace," STOC, pp. 235-244, 1993.
35. C. H. Papadimitriou, Computational complexity. 1993. Addison Wesley.
36. A. Renyi, Probability theory. 1970. North-Holland, Amsterdam.
37. M. Sipser, "A complexity theoretic approach to randomness," STOC, pp. 330-335, 1983.
38. M. Sipser, Introduction to the theory of computation. PWS Publishing, 1997.
39. L. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, no. 8, pp. 189-201, 1979.
40. L. Valiant and V. Vazirani, "NP is as easy as detecting unique solutions," Theoretical Computer Science, vol. 47, pp. 85-93, 1986.
41. M. Wegman and J. Carter, "New hash functions and their use in authentication and set equality," Journal of Computer and System Sciences, vol. 22, no. 3, pp. 265-279, 1981.
42. A. Yao, "Theory and applications of trapdoor functions," FOCS, pp. 80-91, 1982.
43. A. Yao, "Separating the polynomial-time hierarchy by oracles," FOCS, pp. 1-10, 1985.