Improved Pseudorandom Generators for Combinatorial Rectangles

We explicitly construct a pseudorandom generator which uses O(log m + log d + log3/2 1/e) bits and approximates the volume of any combinatorial rectangle in [m]d = {1,... m}d to within e error. This improves on the previous construction by Armoni, Saks, Wigderson, and Zhou [4] using O(log m + log d + log2 1/e) bits. For a subclass of rectangles with at most t ≥ log 1/e nontrivial dimensions and each dimension being an interval, we also give a pseudorandom generator using O(log log d + log 1/e log1/2 t/log 1/e) bits, which again improves the previous upper bound O(log log d + log 1/e log t/log 1/e) by Chari, Rohatgi, and Srinivasan [5].

[1]  Michael E. Saks,et al.  Discrepancy sets and pseudorandom generators for combinatorial rectangles , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  José D. P. Rolim,et al.  Efficient Construction of Hitting Sets for Systems of Linear Functions , 1997, STACS.

[3]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

[4]  Aravind Srinivasan,et al.  Improved Algorithms via Approximations of Probability Distributions , 2000, J. Comput. Syst. Sci..

[5]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[6]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

[7]  Aravind Srinivasan,et al.  Improved algorithms via approximations of probability distributions (extended abstract) , 1994, STOC '94.

[8]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[9]  Aravind Srinivasan,et al.  Approximating hyper-rectangles: learning and pseudo-random sets , 1997, STOC '97.

[10]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[11]  Aravind Srinivasan,et al.  Approximating Hyper-Rectangles: Learning and Pseudorandom Sets , 1998, J. Comput. Syst. Sci..

[12]  Avi Wigderson,et al.  Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing , 1994, STOC '94.

[13]  Avi Wigderson,et al.  Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.

[14]  Noam Nisan,et al.  Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[15]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[16]  Ran Raz,et al.  Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.

[17]  Noam Nisan,et al.  Velickovic approximations of general independent distributions , 1992, Symposium on the Theory of Computing.

[18]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[19]  Michael E. Saks,et al.  Efficient construction of a small hitting set for combinatorial rectangles in high dimension , 1993, Comb..

[20]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.