Testing polynomials over general fields

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 413-422

  Kaufman, Tali ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIALS; GENERALIZED REED-MULLER (GRM); GRM CODES; POLYNOMIAL TESTING;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); QUERY LANGUAGES; THEOREM PROVING;

POLYNOMIALS;

EID: 17744373121     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2004.65     Document Type: Conference Paper

References (27)

1. N. Alon, M. Krivelevich, T. Kaufman, S. Litsyn, and D. Ron. Testing low-degree polynomials over GF(2). In Proceedings of the 7th RANDOM, pages 188-199, 2003.
2. S. Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley, 1994.
3. S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proceedings of the 29th STOC, pages 485-495, 1997.
4. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the 23rd STOC, pages 21-31, 1991.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
6. L. Babai, A. Shpilka, and D. Stefankovic. Locally testable cyclic codes. In Proceedings of the 44th FOCS, pages 116-125, 2003.
7. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan. Linearity testing over characteristic two. IEEE Trans. on IT, 42(6): 1781-1795, 1996.
8. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th STOC, pages 294-304, 1993.
9. M. Bellare and M. Sudan. Improved non-approximability results. In Proceedings of the 26th STOC, pages 184-193, 1994.
10. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the 36th STOC, pages 1-10, 2004.
11. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova. 3CNF properties are hard to test. In Proceedings of the 35th STOC, 2003.
12. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Derandomizing low degree tests via epsilon-biased spaces. In Proceedings of the 35th STOC, pages 612-621, 2003.
13. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. JCSS, 47:549-595, 1993.
14. P. Ding and J.D. Key. Minimum-weight codewords as generators of generalized Reed-M-uller codes. IEEE Trans. on IT, 46(6):2152-2157, 2000.
15. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. JACM, pages 268-292, 1996.
16. K. Friedl and M. Sudan. Some improvements to total degree tests. In Proceedings of the 3rd ISTCS, pages 190-198, 1995. Corrected version available online at http://theory.lcs.mit.edu/~madhu/papers/friedl.ps.
17. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings of the 23rd STOC, pages 32-42, 1991.
18. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
19. O. Goldreich and D. Ron. A sublinear bipartite tester for bounded degree graphs. Combinatorial, 19(3):335-373, 1999.
20. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, pages 302-343, 2002.
21. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost-linear length. In Proceedings of the 43rd FOCS, pages 13-22, 2002.
22. C. S. Jutla, A. C. Patthak, A. Rudra, and D. Zuckerman. Testing low-degree polynomials over prime fields. In Proceedings of the 45th FOCS, 2004. In these proceedings.
23. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. In Proceedings of the 7th RANDOM, pages 341-353, 2003.
24. T. Kaufman and D. Ron. Testing polynomials over general fields. http://www.eng.tau.ac.il/~danar/papers.html, 2004.
25. A. Polishchuk and D. Spielman. Nearly-linear size holo-graphic proofs. In Proceedings of the 26th STOC, pages 194-203, 1994.
26. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SICOMP, 25(2):252-271, 1996.
27. A. Shpilka and A. Wigderson. Derandomizing homomorphism testing in general groups. In Proceedings of the 36th STOC, pages 427-435, 2004.