Hardness of reconstructing multivariate polynomials over finite fields

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

Volumn , Issue , 2007, Pages 349-359

  Gopalan, Parikshit ^a   Khot, Subhash ^b   Saket, Rishi ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b Georgia Tech

Author keywords

[No Author keywords available]

Indexed keywords

FINITE FIELDS; MULTIVARIATE POLYNOMIALS; POLYNOMIAL RECONSTRUCTION;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MULTIVARIABLE SYSTEMS; POLYNOMIAL APPROXIMATION;

POLYNOMIALS;

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

References (25)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, 1998.
3. S. Arora and M. Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365-426, 2003.
4. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM, 50(4):506-519, 2003.
5. th IEEE Symp. on Foundations of Computer Science (FOCS'04), pages 335-341, 2004.
6. V. Feldman. Optimal hardness results for maximizing agreements with monomials. In Proc. IEEE Conf. Computational Complexity, pages 226-236, 2006.
7. th IEEE Symp. on Foundations of Computer Science, 2006.
8. st ACM Symp. Theory of Computing, pages 25-32, 1989.
9. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning polynomials with queries: The highly noisy case. SIAM J. Discrete Math., 13(4):535-570, 2000.
10. P. Gopalan, S. Khot, and R. Saket. Hardness of reconstructing multivariate polynomials over finite fields, posted to ECCC, 2007.
11. P. Gopalan, A. Klivans, A. Rao, and D. Zuckerman. List-Decoding Reed-Muller codes over small fields, manuscript, 2007.
12. V. Guruswami. List Decoding of Error-Correcting Codes, volume 3282 of Lecture Notes in Computer Science. Springer, 2004.
13. th ACM Symp. Theory of Computing, pages 1-10, 2006.
14. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and Algebraic-Geometric codes. IEEE Trans. Info. Theory, 45(6):1757-1767, 1999.
15. V. Guruswami and A. Vardy. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In Proc. 16th ACM-SIAM Symp. on Discrete algorithms, 2005.
16. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
17. th IEEE Symp. Foundations of Computer Science, pages 11-20, 2005.
18. rd ACM Symp. Theory of Computing, pages 455-464, 1991.
19. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and learnability. J. ACM, 40(3):607-620, 1993.
20. th IEEE Symp. Foundations of Computer Science, pages 285-294, 2005.
21. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕}. Methematical Notes of the Academy of Science of the USSR, 41:333-338, 1987.
22. th ACM Symp. Theory of Computing, pages 77-82, 1987.
23. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity, 13(1): 180-193, 1997.
24. M. Sudan, L. Trevisan, and S. P. Vadhan. Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci., 62(2):236-266, 2001.
25. nd IEEE Symp. on Foundations of Computer Science, pages 638-647, 2001.