Testing polynomials over general fields

In this work we fill in the knowledge gap concerning testing polynomials over finite fields. As previous works show, when the cardinality of the field, q, is sufficiently larger than the degree bound, d, then the number of queries sufficient for testing is polynomial or even linear in d. On the other hand, when q = 2 then the number of queries, both sufficient and necessary, grows exponentially with d. Here we study the intermediate case where 2 < q /spl les/ O(d) and show a smooth transition between the two extremes. Specifically, let p be the characteristic of the field (so that p is prime and q = p/sup s/ for some integer s > 1). Then the number of queries performed by the test grows like /spl lscr/ /spl middot/ q/sup 2/spl lscr/+1/, where /spl lscr/ = /spl lceil/(d+1)/((q-q)/p)/spl rceil/. Furthermore, q/sup /spl Omega/(/spl lscr/)/ queries are necessary when q /spl les/ O(d). The test itself provides a unifying view of the two extremes: it considers random affine subspaces of dimension /spl lscr/ and verifies that the function restricted to the selected subspaces is a degree d polynomial. Viewed in the context of coding theory, our result shows that Reed-Muller codes over general fields (usually referred to as generalized Reed-Muller (GRM) codes) are locally testable. In the course of our analysis we provide a characterization of small-weight words that span the code. Such a characterization was previously known only when the field size is a prime or is sufficiently large, in which case the minimum weight words span the code.

[1]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[2]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..

[3]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

[4]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[5]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[6]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[7]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[8]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..

[9]  László Babai,et al.  Locally testable cyclic codes , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[11]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.

[12]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[13]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[15]  Avi Wigderson,et al.  Derandomizing Homomorphism Testing in General Groups , 2006, SIAM J. Comput..

[16]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[17]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[18]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2006, JACM.

[19]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[20]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[21]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[22]  Peng Ding,et al.  Minimum-weight codewords as generators of generalized Reed-Muller codes , 2000, IEEE Trans. Inf. Theory.

[23]  Dana Ron,et al.  Testing Polynomials over General Fields , 2006, SIAM J. Comput..

[24]  Eli Ben-Sasson,et al.  3CNF Properties are Hard to Test , 2003, Electron. Colloquium Comput. Complex..

[25]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[26]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[27]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[28]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[29]  Simon Litsyn,et al.  Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[30]  Madhu Sudan,et al.  Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems , 1995, Lecture Notes in Computer Science.

[31]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.