Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > FOOL:
Reports tagged with fool:
TR07-132 | 8th December 2007
Emanuele Viola

The sum of d small-bias generators fools polynomials of degree d

We prove that the sum of $d$ small-bias generators $L
: \F^s \to \F^n$ fools degree-$d$ polynomials in $n$
variables over a prime field $\F$, for any fixed
degree $d$ and field $\F$, including $\F = \F_2 =
{0,1}$.

Our result improves on both the work by Bogdanov and
Viola ... more >>>




ISSN 1433-8092 | Imprint