Improved pseudorandom generators for combinatorial rectangles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 223-234

  Lu, Chi Jen ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

PSEUDORANDOM GENERATORS; UPPER BOUND;

GEOMETRY;

EID: 84878585103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055056     Document Type: Conference Paper

References (14)

1. A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim, Efficient constructions of hitting sets for system of linear functions, In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pages 387-398, 1997
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms, 3(3), pages 289-303, 1992.
3. P. Auer, P. Long, and A. Srinivasan, Approximating hyper-rectangles: learning and pseudo-random sets, In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997.
4. R. Armoni, M. Saks, A. Wigderson, and S. Zhou, Discrepancy sets and pseudorandom generators for combinatorial rectangles, In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 412-421, 1996.
5. S. Chari, P. Rohatgi, and A. Srinivasan, Improved algorithms via approximations of probability distributions, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 584-592, 1994.
6. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic, Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 10-16, 1992.
7. O. Goldreich and A. Wigderson, Tiny families of functions with random properties: a quality-size trade-off for hashing, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 574-583, 1994.
8. R. Impagliazzo, N. Nisan, and A. Wigderson, Pseudorandomness for network algorithms, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 356-364, 1994.
9. N. Linial, M. Luby, M. Saks, and D. Zuckerman, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 258-267, 1993.
10. J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing, 22(4), pages 838-856, 1990.
11. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica, 12, pages 449-461, 1992.
12. N. Nisan, Extracting randomness: how and why - a survey, In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44-58, 1996.
13. N. Nisan and D. Zuckerman, Randomness is linear in space, Journal of Computer and System Sciences, 52(1), pages 43-52, 1996.
14. J. Radhakrishnan and A. Ta-shma, Private communication.