Discrepancy sets and pseudorandom generators for combinatorial rectangles

A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space that approximates the volume of any combinatorial rectangle in [n]/sup n/ to within o(1) error. The construction extends the previous techniques for the analogous hitting set problem, most notably via discrepancy preserving reductions.

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

[2]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[3]  David R. Karger,et al.  (De)randomized Construction of Small Sample Spaces in NC , 1997, J. Comput. Syst. Sci..

[4]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

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

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

[7]  József Beck,et al.  Irregularities of distribution: Index of theorems and corollaries , 1987 .

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

[9]  William W. L. Chen On irregularities of distribution. , 1980 .

[10]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[11]  J. Beck,et al.  Irregularities of Distribution by Jozsef Beck , 1987 .

[12]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[13]  David R. Karger,et al.  (De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/ , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[15]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

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

[17]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[18]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[19]  Leonard J. Schulman Sample spaces uniform on neighborhoods , 1992, STOC '92.

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

[21]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

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

[23]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[24]  Nimrod Megiddo,et al.  Constructing small sample spaces satisfying given constraints , 1993, SIAM J. Discret. Math..