Pseudorandom generators for combinatorial checkerboards

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 232-242

  Watson, Thomas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Combinatorial checkerboards; Pseudorandom generators

Indexed keywords

COMBINATORIAL CHECKERBOARDS; PSEUDORANDOM GENERATORS;

COMPUTATIONAL COMPLEXITY; SEED;

DYNAMIC RANDOM ACCESS STORAGE;

EID: 80051962264     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.12     Document Type: Conference Paper

References (40)

1. N. Nisan and A. Wigderson, "Hardness vs. randomness," Journal of Computer and System Sciences, vol. 49, no. 2, pp. 149-167, 1994.
2. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, "BPP has subexponential time simulations unless EXP-TIME has publishable proofs," Computational Complexity, vol. 3, pp. 307-318, 1993.
3. R. Impagliazzo and A. Wigderson, "P = BPP if E requires exponential circuits: Derandomizing the XOR lemma," in Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 220-229.
4. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR lemma," Journal of Computer and System Sciences, vol. 62, no. 2, pp. 236-266, 2001. (Pubitemid 32334551)
5. R. Impagliazzo, R. Shaltiel, and A. Wigderson, "Reducing the seed length in the Nisan-Wigderson generator," Combinatorica, vol. 26, no. 6, pp. 647-681, 2006.
6. R. Shaltiel and C. Umans, "Simple extractors for all minentropies and a new pseudorandom generator," Journal of the ACM, vol. 52, no. 2, pp. 172-216, 2005. (Pubitemid 41655758)
7. C. Umans, "Pseudo-random generators for all hardnesses," Journal of Computer and System Sciences, vol. 67, no. 2, pp. 419-440, 2003.
8. R. Impagliazzo, V. Kabanets, and A. Wigderson, "In search of an easy witness: Exponential time vs. probabilistic polynomial time," Journal of Computer and System Sciences, vol. 65, no. 4, pp. 672-694, 2002. (Pubitemid 41161945)
9. R. Impagliazzo and V. Kabanets, "Derandomizing polynomial identity tests means proving circuit lower bounds," Computational Complexity, vol. 13, no. 1-2, pp. 1-46, 2004. (Pubitemid 41217703)
10. S. Aaronson and D. van Melkebeek, "A note on circuit lower bounds from derandomization," Electronic Colloquium on Computational Complexity, Tech. Rep. TR10-105, 2010.
11. O. Goldreich, "In a world of P = BPP," Electronic Colloquium on Computational Complexity, Tech. Rep. TR10-135, 2010.
12. M. Ajtai, J. Komlós, and E. Szemerédi, "Deterministic simulation in LOGSPACE," in Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 132-140.
13. L. Babai, N. Nisan, and M. Szegedy, "Multiparty protocols, pseudorandom generators for logspace, and timespace trade-offs," Journal of Computer and System Sciences, vol. 45, no. 2, pp. 204-232, 1992. (Pubitemid 23572023)
14. N. Nisan, "Pseudorandom generators for space-bounded computation," Combinatorica, vol. 12, no. 4, pp. 449-461, 1992.
15. -, "RL ⊆ SC," Computational Complexity, vol. 4, pp. 1-11, 1994.
16. 1.5(n)) space," in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 24-29.
17. N. Nisan and D. Zuckerman, "Randomness is linear in space," Journal of Computer and System Sciences, vol. 52, no. 1, pp. 43-52, 1996. (Pubitemid 126340848)
18. R. Impagliazzo, N. Nisan, and A. Wigderson, "Pseudorandomness for network algorithms," in Proceedings of the 26th ACM Symposium on Theory of Computing, 1994, pp. 356-364.
19. 3/2)," Journal of Computer and System Sciences, vol. 58, no. 2, pp. 376-403, 1999.
20. 4/3(n)) space algorithm for (s, t) connectivity in undirected graphs," Journal of the ACM, vol. 47, no. 2, pp. 294-311, 2000.
21. R. Raz and O. Reingold, "On recycling the randomness of states in space bounded computation," in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, pp. 159-168.
22. J.-Y. Cai, V. Chakaravarthy, and D. van Melkebeek, "Time-space tradeoff in derandomizing probabilistic logspace," Theory of Computing Systems, vol. 39, no. 1, pp. 189-208, 2006. (Pubitemid 43099538)
23. O. Reingold, "Undirected connectivity in log-space," Journal of the ACM, vol. 55, no. 4, 2008.
24. E. Rozenman and S. Vadhan, "Derandomized squaring of graphs," in Proceedings of the 9th International Workshop on Randomization and Computation, 2005, pp. 436-447. (Pubitemid 41480454)
25. O. Reingold, L. Trevisan, and S. Vadhan, "Pseudorandom walks on regular digraphs and the RL vs. L problem," in Proceedings of the 38th ACM Symposium on Theory of Computing, 2006, pp. 457-466. (Pubitemid 44306580)
26. S. Lovett, O. Reingold, L. Trevisan, and S. Vadhan, "Pseudorandom bit generators that fool modular sums," in Proceedings of the 13th International Workshop on Randomization and Computation, 2009, pp. 615-630.
27. A. Bogdanov, Z. Dvir, E. Verbin, and A. Yehudayoff, " Pseudorandomness for width 2 branching programs," Electronic Colloquium on Computational Complexity, Tech. Rep. TR09-070, 2009.
28. M. Braverman, A. Rao, R. Raz, and A. Yehudayoff, "Pseudorandom generators for regular branching programs," in Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010, pp. 40-47.
29. J. Brody and E. Verbin, "The coin problem, and pseudorandomness for branching programs," in Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010, pp. 30-39.
30. M. Koucký, P. Nimbhorkar, and P. Pudlák, "Pseudorandom generators for group products," in Proceedings of the 43rd ACM Symposium on Theory of Computing (to appear), 2011.
31. J. Naor and M. Naor, "Small-bias probability spaces: Efficient constructions and applications," SIAM Journal on Computing, vol. 22, no. 4, pp. 838-856, 1993. (Pubitemid 23677151)
32. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, "Simple constructions of almost k-wise independent random variables," Random Structures and Algorithms, vol. 3, no. 3, pp. 289-304, 1992.
33. 0," Random Structures and Algorithms, vol. 29, no. 1, pp. 56-81, 2006.
34. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic, "Efficient approximation of product distributions," Random Structures and Algorithms, vol. 13, no. 1, pp. 1-16, 1998.
35. N. Linial, M. Luby, M. Saks, and D. Zuckerman, "Efficient construction of a small hitting set for combinatorial rectangles in high dimension," Combinatorica, vol. 17, no. 2, pp. 215-234, 1997.
36. R. Armoni, M. Saks, A. Wigderson, and S. Zhou, "Discrepancy sets and pseudorandom generators for combinatorial rectangles," in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 412-421.
37. C.-J. Lu, "Improved pseudorandom generators for combinatorial rectangles," Combinatorica, vol. 22, no. 3, pp. 417-434, 2002.
38. E. Viola, "The sum of d small-bias generators fools polynomials of degree d," Computational Complexity, vol. 18, no. 2, pp. 209-217, 2009.
39. P. Gopalan, R. Meka, O. Reingold, and D. Zuckerman, "Pseudorandom generators for combinatorial shapes," in Proceedings of the 43rd ACM Symposium on Theory of Computing (to appear), 2011.
40. O. Gabber and Z. Galil, "Explicit constructions of linear-sized superconcentrators," Journal of Computer and System Sciences, vol. 22, no. 3, pp. 407-420, 1981.