Testing low-degree polynomials over GF(2)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 188-199

  Alon, Noga ^a,b   Kaufman, Tali ^a   Krivelevich, Michael ^a   Litsyn, Simon ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; POLYNOMIALS;

BINARY FUNCTIONS; E-FRACTIONS; LOW DEGREE; POLYNOMIALS OVER GF(2); RANDOMIZED ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 35248821354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_17     Document Type: Article

References (18)

1. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy. Regular languages are testable with a constant number of queries. In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pages 645-655, 1999.
2. S. Arora and S. Safra. Improved low-degree testing and its applications. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pages 485-495, 1997.
3. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pages 21-31, 1991.
4. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
5. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan. Linearity testing in characteristic two. In Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science, pages 432-441, 1995.
6. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 294-304, 1993.
7. M. Bellare and M. Sudan. Improved non-approximability results. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 184-193, 1994.
8. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova. 3CNF properties are hard to test. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, 2003. To appear.
9. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Derandomizing low degree tests via epsilon-biased spaces. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, 2003. To appear.
10. 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.
11. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. Journal of the Association for Computing Machinery, pages 268-292, 1996.
12. 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 online at http://theory.lcs.mit.edu/~madhu/papers/friedl.ps.
13. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pages 32-42, 1991.
14. M. Hall. Combinatorial Theory. John Wiley & Sons, 1967.
15. T. Kasami, S. Lin, and W.W. Peterson. New generalizations of the reed-muller codes, part i: Primitive codes. IEEE Transactions on Information Theory, pages 189-199, 1968.
16. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North Holland, 1977.
17. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
18. M. Sudan. Private communications, 1995.