Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR15-205 | 15th December 2015 18:17

#### Quadratic maps are hard to sample

TR15-205
Authors: Emanuele Viola
Publication: 15th December 2015 18:18
$p : \{0,1\}^n \to \{0,1\}$ such that no constant-depth circuit
of size $\poly(n)$ can sample the distribution $(u,p(u))$
for uniform $u$.