TY - JOUR
T1 - Discrepancy sets and pseudorandom generators for combinatorial rectangles
AU - Armoni, Roy
AU - Saks, Michael
AU - Wigderson, Avi
AU - Zhou, Shiyu
PY - 1996
Y1 - 1996
N2 - 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]n to within o(1) error (improving on the constructions of [EGLNV92]). The construction extends the techniques of [LLSZ95] for the analogous hitting set problem, most notably via discrepancy preserving reductions.
AB - 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]n to within o(1) error (improving on the constructions of [EGLNV92]). The construction extends the techniques of [LLSZ95] for the analogous hitting set problem, most notably via discrepancy preserving reductions.
UR - http://www.scopus.com/inward/record.url?scp=0030402040&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0030402040
SN - 0272-5428
SP - 412
EP - 421
JO - Annual Symposium on Foundations of Computer Science - Proceedings
JF - Annual Symposium on Foundations of Computer Science - Proceedings
T2 - Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science
Y2 - 14 October 1996 through 16 October 1996
ER -