ABSTRACT
We give an explicit construction of pseudorandom generators against low degree polynomials over finite fields. We show that the sum of 2d small-biased generators with error ε2O(d) is a pseudorandom generator against degree d polynomials with error ε. This gives a generator with seed length 2O(d) log(n/ε). Our construction follows the recent breakthrough result of Bogadnov and Viola. Their work shows that the sum of d small-biased generators is a pseudo-random generator against degree d polynomials, assuming the Inverse Gowers Conjecture. However, this conjecture is only proven for d=2,3. The main advantage of our work is that it does not rely on any unproven conjectures.
- . Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almostk--wise independent random variables. In Random Structures & Algorithms, 3(3):289--304, 1992Google Scholar
- . Bellare, D. Coppersmith, J. Hastad, M. Kiwi, and M. Sudan. Linearitytesting over characteristic two. In IEEE Transactions on Information Theory,42(6): 1781--1795, 1996. Google Scholar
Digital Library
- . Blum, M. Luby and R. Rubinfeld. Self--Testing/Correcting with Applications to NumericalProblems. In Journal of Computer and System Sciences,47(3):549--595, 1993 Google Scholar
Digital Library
- . Bogdanov, Pseudorandom generators for low degreepolynomials. In Proceedings of the 37th Annual ACM Symposiumon Theory of Computing (STOC 2005), pages 21--30, New York, 2005.ACM. Google Scholar
Digital Library
- . Ben-Sasson, M. Sudan, S. Vadhan, and A.Wigderson. Randomness--efficient low degree tests and short PCPsvia epsilon--biased sets. In Proceedings of the 35th AnnualACM Symposium on Theory of Computing (STOC 2003), pages 612--621(electronic),2003. Google Scholar
Digital Library
- . Bogdanov and E. Viola.Pseudorandom bits for polynomials via the Gowers norm. In the 48th Annual Symposium on Foundations of Computer Science(FOCS 2007). Google Scholar
Digital Library
- . Green and T. Tao. An inverse theorem for the Gowers U3 norm.To appear in Proceedings of the Edinburgh Mathematical Society.Google Scholar
- . Green and T. Tao, The distribution of polynomials overfinite fields, with applications to the Gowers norms. preprint.Google Scholar
- . Lovett, R. Meshulam and A. Samorodnitsky, InverseConjecture for the Gowers norm is false. To appear in Proceedings of the 40th AnnualACM Symposium on Theory of Computing (STOC 2008), 2008. Google Scholar
Digital Library
- . Luby, B. Velickovic, and A. Wigderson. DeterministicApproximate Counting of Depth--2 Circuits. In Proceedings ofthe 2nd Israeli Symposium on Theoretical Computer Science(ISTCS), pages 18--24, 1993.Google Scholar
- . Naor and M. Naor. Small--bias probability spaces: efficient constructions andapplications. In Proceedings of the 22nd Annual ACM Symposiumon the Theory of Computing (STOC 1990), pages 213--223, 1990. Google Scholar
Digital Library
- . Samorodnitsky, Low--degree tests at largedistances. In Proceedings of the 39th Annual ACM Symposium onTheory of computing (STOC 2007), pages 506--515, 2007. Google Scholar
Digital Library
- . Samorodnitsky and L. Trevisan.Gowers uniformity, influence of variables, and PCPs. In Proceedings of the 38th Annual ACM Symposium on Theory ofComputation (STOC 2006), pages 11--20, 2006. Google Scholar
Digital Library
- . Viola. New correlation bounds for GF(2) polynomialsusing Gowers uniformity. In Electronic Colloquium onComputational Complexity, Technical Report TR06--097, 2006.http://www.eccc.uni--trier.de/eccc.Google Scholar
- . Viola. Pseudorandom Bits for Constant--Depth Circuitswith Few Arbitrary Symmetric Gates. In SIAM Journal onComputing, 36(5):1387--1403, 2007. Google Scholar
Digital Library
- . Viola, The sum of d small-bias generators foolspolynomials of degree d. To appear in Proceedings of the 23th IEEE Conference onComputational Complexity (CCC), 2008. Google Scholar
Digital Library
- . Viola and A. Wigderson. Norms, XOR lemmas, and lowerbounds for GF(2) polynomials and multiparty protocols. In Proceedings of the 22nd Annual Conference on ComputationalComplexity, IEEE, June 13--16 2007. Google Scholar
Digital Library
Index Terms
Unconditional pseudorandom generators for low degree polynomials
Recommendations
Pseudorandom Generators without the XOR Lemma
COCO '99: Proceedings of the Fourteenth Annual IEEE Conference on Computational ComplexityImpagliazzo and Wigderson (STOC 97) have recently shown that if there exists a decision problem solvable in time 2^{O(n)} and having circuit complexity 2^{Omega(n)} (for all but finitely many n) then P=BPP. This result is a culmination of a series of ...
Pseudorandom Generators without the XOR Lemma
Special issue on the fourteenth annual IEE conference on computational complexityR. Impagliazzo and A. Wigderson (1997, in “Proceedings of the twenty-ninth Annual ACM Symposium on Theory of Computing,” pp. 220 229) have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (...
Pseudorandom generators for polynomial threshold functions
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/εO(d) fooling degree d PTFs with error at most ε. Previously, no nontrivial ...






Comments