Skip to main content
Log in

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

  • Published:
computational complexity Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emanuele Viola.

Additional information

Manuscript received 1 September 2008

Rights and permissions

Reprints and permissions

About this article

Cite this article

Viola, E. The Sum of D Small-Bias Generators Fools Polynomials of Degree D. comput. complex. 18, 209–217 (2009). https://doi.org/10.1007/s00037-009-0273-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-009-0273-5

Keywords.

Subject classification.

Navigation