Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Lower Bounds for Approximations by Low Degree Polynomials Over Z_m
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Testing Polynomials over General Fields
SIAM Journal on Computing
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Testing low-degree polynomials over prime fields
Random Structures & Algorithms
Optimal Testing of Reed-Muller Codes
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Optimal Testing of Multivariate Polynomials over Small Prime Fields
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this article, we present a new hardness amplification for low-degree polynomials over prime fields, namely, we prove that if some function is mildly hard to approximate by any low-degree polynomials then the sum of independent copies of the function is very hard to approximate by them. This result generalizes the XOR lemma for low-degree polynomials over the binary field given by Viola and Wigderson [2008]. The main technical contribution is the analysis of the Gowers norm over prime fields. For the analysis, we discuss a generalized low-degree test, which we call the Gowers test, for polynomials over prime fields, which is a natural generalization of that over the binary field given by Alon et al. [2003]. This Gowers test provides a new technique to analyze the Gowers norm over prime fields. Actually, the rejection probability of the Gowers test can be analyzed in the framework of Kaufman and Sudan [2008]. However, our analysis is self-contained and quantitatively better. By using our argument, we also prove the hardness of modulo functions for low-degree polynomials over prime fields.