Skip to main content
Log in

Efficiently Testing Sparse GF(2) Polynomials

Algorithmica Aims and scope Submit manuscript

Abstract

We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f:{0,1}n→{−1,1} is an s-sparse GF(2) polynomial versus ε-far from every such polynomial. Our algorithm makes poly(s,1/ε) black-box queries to f and runs in time n⋅poly(s,1/ε). The only previous algorithm for this testing problem (Diakonikolas et al. in Proceedings of the 48th Annual Symposium on Foundations of Computer Science, FOCS, pp. 549–558, 2007) used poly(s,1/ε) queries, but had running time exponential in s and super-polynomial in 1/ε.

Our approach significantly extends the “testing by implicit learning” methodology of Diakonikolas et al. (Proceedings of the 48th Annual Symposium on Foundations of Computer Science, FOCS, pp. 549–558, 2007). The learning component of that earlier work was a brute-force exhaustive search over a concept class to find a hypothesis consistent with a sample of random examples. In this work, the learning component is a sophisticated exact learning algorithm for sparse GF(2) polynomials due to Schapire and Sellie (J. Comput. Syst. Sci. 52(2):201–213, 1996). A crucial element of this work, which enables us to simulate the membership queries required by Schapire and Sellie (J. Comput. Syst. Sci. 52(2):201–213, 1996), is an analysis establishing new properties of how sparse GF(2) polynomials simplify under certain restrictions of “low-influence” sets of variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Proceedings of RANDOM-APPROX, pp. 188–199 (2003)

  2. Angluin, D.: Queries and concept learning. Mach. Learn. 2, 319–342 (1988)

    Google Scholar 

  3. 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)

  4. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 549–595 (1993). Earlier version in STOC’90

    Article  MathSciNet  MATH  Google Scholar 

  5. Bshouty, N.: Simple learning algorithms using divide and conquer. Comput. Complex. 6, 174–194 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bshouty, N.: On learning multivariate polynomials under the uniform distribution. Inf. Process. Lett. 61(3), 303–309 (1997)

    Article  MathSciNet  Google Scholar 

  7. Bshouty, N., Mansour, Y.: Simple learning algorithms for decision trees and multivariate polynomials. SIAM J. Comput. 31(6), 1909–1925 (2002)

    Article  MathSciNet  Google Scholar 

  8. Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 549–558 (2007)

  9. Ehrenfeucht, A., Karpinski, M.: The computational complexity of (XOR, AND)-counting problems. Technical report. Preprint (1989)

  10. Fischer, E.: The art of uninformed decisions: a primer to property testing. Comput. Complex. Column Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97–126 (2001)

    MATH  Google Scholar 

  11. Fischer, P., Simon, H.U.: On learning ring-sum expansions. SIAM J. Comput. 21(1), 181–192 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Comput. Syst. Sci. 68, 753–787 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Goldreich, O., Goldwaser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653–750 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Grigoriev, D., Karpinski, M., Singer, M.: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput. 19(6), 1059–1063 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kahn, J., Kalai, G., Linial, N.: The influence of variables on boolean functions. In: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 68–80 (1988)

  16. Karpinski, M.: Boolean circuit complexity of algebraic interpolation problems. TR-89-027 (1989)

  17. Karpinski, M., Luby, M.: Approximating the number of zeros of a GF[2] polynomial. J. Algorithms 14, 280–287 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Luby, M., Velickovic, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Proceedings of the 2nd ISTCS, pp. 18–24 (1993)

  19. Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. SIAM J. Comput. 24(2), 357–368 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  20. Matulef, K., O’Donnell, R., Rubinfeld, R., Servedio, R.: Testing halfspaces. Technical Report 128, Electronic Colloquium in Computational Complexity (2007)

  21. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)

    MATH  Google Scholar 

  22. Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Discrete Math. 16, 20–46 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, vol. II. Kluwer Academic, Norwell (2001)

    Google Scholar 

  24. Ron, D.: Property testing: a learning theory perspective. COLT 2007 Invited Talk, slides available at http://www.eng.tau.ac.il/danar/Public-ppt/colt07.ppt (2007)

  25. Roth, R., Benedek, G.: Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM J. Comput. 20(2), 291–314 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  26. Rubinfeld, R.: Sublinear time algorithms. In: Proceedings of the International Congress of Mathematicians, ICM, 2006

  27. Schapire, R., Sellie, L.: Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. Syst. Sci. 52(2), 201–213 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Homin K. Lee.

Additional information

Research of I. Diakonikolas was supported by NSF grants CCF-0728736, CCF-0525260, and by an Alexander S. Onassis Foundation Fellowship.

H.K. Lee, R.A. Servedio and A. Wan supported in part by NSF grants CCF-0347282, CCF-0523664 and CNS-0716245, and by DARPA award HR0011-08-1-0069.

K. Matulef supported in part by the National Natural Science Foundation of China Grant 60553001, the National Basic Research Program of China Grant 2007CB807900,2007CB807901, and the US National Science Foundation grants 0514771, 0732334, 0728645.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diakonikolas, I., Lee, H.K., Matulef, K. et al. Efficiently Testing Sparse GF(2) Polynomials. Algorithmica 61, 580–605 (2011). https://doi.org/10.1007/s00453-010-9426-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-010-9426-9

Keywords

Navigation