Testing Low-Degree Polynomials over Prime Fields

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

Volumn , Issue , 2004, Pages 423-432

  Jutla, Charanjit S ^a   Rudra, Atri ^b   Patthak, Anindya C ^c   Zuckerman, David ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Washington   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIVARIATE POLYNOMIALS; POLYNOMIAL TESTING; REED-MULLER CODES;

ALGORITHMS; CODES (SYMBOLS); EXTRAPOLATION; PROBABILITY; PROBLEM SOLVING; QUERY LANGUAGES;

POLYNOMIALS;

EID: 17744378802     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. +03] N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, and D. Ron. Testing low-degree ploynomials over GF(2). In Proc. of RANDOM 03, 2003.
2. +92] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the intractability of approximation problems. In Proc. of IEEE Symposium of the Foundation of Computer Science, pages 14-23, 1992.
3. [AS92] S. Arora and S. Safra. Probabilistic chekcing of proofs: A new characterization of NP. In Proc. of IEEE Symposium of the Foundation of Computer Science, pages 2-13, 1992.
4. [AS97] S. Arora and M. Sudan. Improved low-degree testing and its application. In Proc. of Symposium on the Theory of Computing, 1997.
5. [BFL91] L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two prover interactive protocols. In Computational Complexity, pages 3-40, 1991.
6. [BFLS91] L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proc. of Symposium on the Theory of Computing, pages 21-31, 1991.
7. [BLR93] M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47:549-595, 1993.
8. [DGM70] P. Delsarte, J. M. Goethals, and F. J. MacWillams. On generalized reed-muller codes and their relatives. Information and Control, 16:403-442, 1970.
9. [DK00] P. Ding and J. D. Key. Minimum-weight codewords as generators of generalized reed-muller codes. IEEE Trans. on Information Theory., 46:2152-2158, 2000.
10. [FGL+91] U. Fiege, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost npcomplete. In Proc. of IEEE Symposium of the Foundation of Computer Science, pages 2-12, 1991.
11. [FS95] K. Friedl and M. Sudan. Some improvements to total degree tests. In Proceedings of the 3rd Annual Israel symposium on Theory of Computing and Systems, pages 190-198, 1995. Corrected version available at http://theory.lcs.mit.edu/~madhu/papers/friedl.ps.
12. +91] P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approxiamte functions. In Proc. of Symposium on the Theory of Computing, 1991.
13. [KR04] T. Kaufman and D. Ron. Testing polynomials over general fields. In Proc. of IEEE Symposium of the Foundation of Computer Science, 2004.
14. [PH98] V. S. Pless, Jr. and W. C. Huffman, editors. Handbook of Coding Theory, Vol II, chapter 16. Elsevier, 1998.
15. [RS96] R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
16. [Sud01] M. Sudan. Lecture notes on algorithmic introduction to coding theory, Fall 2001. Lecture 15.