The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 412
R. Armoni , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
M. Saks , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
A. Wigderson , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
Shiyu Zhou , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
ABSTRACT
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.
INDEX TERMS
random number generation; discrepancy sets; pseudorandom generators; combinatorial rectangles; common subproblem; DNF approximate counting; discrepancy problem; poly(n)-size sample space
CITATION

A. Wigderson, R. Armoni, M. Saks and S. Zhou, "Discrepancy sets and pseudorandom generators for combinatorial rectangles," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 412.
doi:10.1109/SFCS.1996.548500
85 ms
(Ver 3.3 (11022016))