179 search results - page 29 / 36 » eccc 2010 |
ECCC
2010
13 years 7 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
ECCC
2010
13 years 7 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
ECCC
2010
13 years 7 months ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
ECCC
2010
13 years 7 months ago
2010
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
ECCC
2010
13 years 7 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...