Discrepancy sets and pseudorandom generators for combinatorial rectangles

Conference · Tue Dec 31 04:00:00 EST 1996

OSTI ID:458102

Armoni, R ^[1]; Saks, M; Zhou, Shiyu ^[2]; Wigderson, A ^[3]

---

1. Hebrew Univ., Jerusalem (Israel)
2. Rutgers Univ., New Brunswick, NJ (United States)
3. Institute for Advanced Study, Olden Lane, Princeton, NJ (United States)

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 (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.

• OSTI ID: 458102
• Report Number(s): CONF-961004--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
MATHEMATICAL LOGIC
SET THEORY