15 search results - page 1 / 3 » On the discrepancy of combinatorial rectangles |
FOCS
1996
IEEE
13 years 9 months ago
1996
IEEE
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 t...
RSA
2002
13 years 5 months ago
2002
Let Bd n denote the family which consists of all subsets S1
EATCS
2000
13 years 5 months ago
2000
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
ECCC
2010
13 years 5 months ago
2010
We define a combinatorial checkerboard to be a function f : {1, . . . , m}d {1, -1} of the form f(u1, . . . , ud) = d i=1 fi(ui) for some functions fi : {1, . . . , m} {1, -1}. T...