Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > CC_0[P]:
Reports tagged with CC_0[p]:
TR10-033 | 6th March 2010
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka

#### Pseudorandom generators for $\mathrm{CC}_0[p]$ and the Fourier spectrum of low-degree polynomials over finite fields

In this paper we give the first construction of a pseudorandom generator, with seed length $O(\log n)$, for $\mathrm{CC}_0[p]$, the class of constant-depth circuits with unbounded fan-in $\mathrm{MOD}_p$ gates, for some prime $p$. More accurately, the seed length of our generator is $O(\log n)$ for any constant error $\epsilon>0$. In ... more >>>

ISSN 1433-8092 | Imprint