Under the auspices of the Computational Complexity Foundation (CCF)
This note proves the existence of a quadratic GF(2) map$p : \{0,1\}^n \to \{0,1\}$ such that no constant-depth circuitof size $\poly(n)$ can sample the distribution $(u,p(u))$for uniform $u$.