Emanuele Viola

The Sum of D Small-Bias Generators Fools Polynomials of Degree D

Abstract.We prove that the sum of d small-bias generators

Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates

L : {\mathbb{F}}^{s} \rightarrow {\mathbb{F}}^{n}

Norms, XOR lemmas, and lower bounds for polynomials and protocols

fools degree-d polynomials in n variables over a field

Fooling Parity Tests with Parity Gates

{\mathbb{F}}

Bounded Independence Fools Halfspaces

, for any fixed degree d and field