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

Abstract.We prove that the sum of d small-bias generators $$L : {\mathbb{F}}^{s} \rightarrow {\mathbb{F}}^{n}$$ fools degree-d polynomials in n variables over a field $${\mathbb{F}}$$, for any fixed degree d and field $${\mathbb{F}}$$, including $${\mathbb{F}} = {\mathbb{F}}_{2} = \{0, 1\}$$. Our result builds on, simplifies, and improves on both the work by Bogdanov and Viola (FOCS ’07) and the follow-up by Lovett (STOC ’08). The first relies on a conjecture that turned out to be true only for some degrees and fields, while the latter considers the sum of 2d small-bias generators (as opposed to d in our result).

[1]  Emanuele Viola,et al.  Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Andrej Bogdanov Pseudorandom generators for low degree polynomials , 2005, STOC '05.

[3]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[4]  Ben Green,et al.  The distribution of polynomials over finite fields, with applications to the Gowers norms , 2007, Contributions Discret. Math..

[5]  Shachar Lovett,et al.  Unconditional pseudorandom generators for low degree polynomials , 2008, Theory Comput..

[6]  Emanuele Viola The Sum of d Small-Bias Generators Fools Polynomials of Degree d , 2008, Computational Complexity Conference.

[7]  Ben Green,et al.  An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement) , 2010, 1009.3998.

[8]  Ben Green,et al.  AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.

[9]  Emanuele Viola Correlation bounds for polynomials over { 0 , 1 , 2009 .

[10]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[11]  Shachar Lovett,et al.  Inverse conjecture for the gowers norm is false , 2007, Theory Comput..

[12]  Emanuele Viola,et al.  Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[13]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.