Sciweavers

15 search results - page 1 / 3
» On the discrepancy of combinatorial rectangles
Sort
View
FOCS
1996
IEEE
13 years 10 months ago
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 t...
Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu ...
RSA
2002
43views more  RSA 2002»
13 years 5 months ago
On the discrepancy of combinatorial rectangles
Let Bd n denote the family which consists of all subsets S1
Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz S...
EATCS
2000
67views more  EATCS 2000»
13 years 6 months ago
Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
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...
A. Srinivasan
STOC
1993
ACM
82views Algorithms» more  STOC 1993»
13 years 10 months ago
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Nathan Linial, Michael Luby, Michael E. Saks, Davi...
ECCC
2010
82views more  ECCC 2010»
13 years 6 months ago
Pseudorandom Generators for Combinatorial Checkerboards
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...
Thomas Watson