Efficiently testing sparse GF(2) polynomials

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 502-514

  Diakonikolas, Ilias ^a   Lee, Homin K ^a   Matulef, Kevin ^a   Servedio, Rocco A ^a   Wan, Andrew ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 49049091374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_41     Document Type: Conference Paper

References (23)

1. [AKK+03] Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Proc. RANDOM, pp. 188-199 (2003)
2. [Ang88] Angluin, D.: Queries and concept learning. Machine Learning 2, 319-342 (1988)
3. [BLR93] Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Comp. Sys. Sci 47, 549-595 (1993); Earlier version in STOC 1990
4. [BM02] Bshouty, N., Mansour, Y.: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. SIAM J. Comput. 31(6), 1909-1925 (2002)
5. [BS90] Blum, A., Singh, M.: Learning functions of k terms. In: Proceedings of the 3rd Annual Workshop on Computational Learning Theory (COLT), pp. 144-153 (1990)
6. [Bsh97a] Bshouty, N.: On learning multivariate polynomials under the uniform distribution. Information Processing Letters 61(3), 303-309 (1997)
7. [Bsh97b] Bshouty, N.: Simple learning algorithms using divide and conquer. Computational Complexity 6, 174-194 (1997)
8. [DLM+07] Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proc. 48th Ann. Symposium on Computer Science (FOCS), pp. 549-558 (2007)
9. [EK89] Ehrenfeucht, A., Karpinski, M.: The computational complexity of (xor,and)-counting problems. Technical report (preprint 1989)
10. [FKR+04] Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. Journal of Computer & System Sciences 68, 753-787 (2004)
11. [FS92] Fischer, P., Simon, H.U.: On learning ring-sum expansions. SIAM Journal on Computing 21(1), 181-192 (1992)
12. [GGR98] Goldreich, O., Goldwaser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45, 653-750 (1998)
13. [GKS90] Grigoriev, D., Karpinski, M., Singer, M.: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM Journal on Computing 19(6), 1059-1063 (1990)
14. [Kar89] Karpinski, M.: Boolean circuit complexity of algebraic interpolation problems (TR-89-027) (1989)
15. [KKL88] Kahn, J., Kalai, G., Linial, N.: The influence of variables on boolean functions. In: Proc. 29th FOCS, pp. 68-80 (1988)
16. [KL93] Karpinski, M., Luby, M.: Approximating the Number of Zeros of a GF[2] Polynomial. Journal of Algorithms 14, 280-287 (1993)
17. [LVW93] Luby, M., Velickovic, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Proceedings of the 2nd ISTCS, pp. 18-24 (1993)
18. [Man95] Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. SIAM Journal on Computing 24(2), 357-368 (1995)
19. [MORS07] Matulef, K., O'Donnell, R., Rubinfeld, R., Servedio, R.: Testing Halfspaces. Technical Report 128, Electronic Colloquium in Computational Complexity (2007)
20. [PRS02] Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Disc. Math. 16, 20-46 (2002)
21. [RB91] Roth, R., Benedek, G.: Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM J. Comput. 20(2), 291-314 (1991)
22. [Ron07] Ron, D.: Property testing: A learning theory perspective. In: Bshouty, N.H., Gentile, C. (eds.) COLT. LNCS (LNAI), vol. 4539. Springer, Heidelberg (2007), http://www.eng.tau.ac.il/~danar/Public-ppt/colt07.ppt
23. [SS96] Schapire, R., Sellie, L.: Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. & Syst. Sci. 52(2), 201-213 (1996)