{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:40:39Z","timestamp":1740260439517,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T00:00:00Z","timestamp":1278979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00453-010-9426-9","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T18:41:43Z","timestamp":1278960103000},"page":"580-605","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Testing Sparse GF(2) Polynomials"],"prefix":"10.1007","volume":"61","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Homin K.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Matulef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,13]]},"reference":[{"key":"9426_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Proceedings of RANDOM-APPROX, pp.\u00a0188\u2013199 (2003)","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"9426_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2, 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"9426_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Singh, M.: Learning functions of k terms. In: Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT, pp.\u00a0144\u2013153 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50014-X"},{"key":"9426_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 549\u2013595 (1993). Earlier version in STOC\u201990","journal-title":"J. Comput. Syst. Sci."},{"key":"9426_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF01262930","volume":"6","author":"N. Bshouty","year":"1997","unstructured":"Bshouty, N.: Simple learning algorithms using divide and conquer. Comput. Complex. 6, 174\u2013194 (1997)","journal-title":"Comput. Complex."},{"issue":"3","key":"9426_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0020-0190(97)00021-5","volume":"61","author":"N. Bshouty","year":"1997","unstructured":"Bshouty, N.: On learning multivariate polynomials under the uniform distribution. Inf. Process. Lett. 61(3), 303\u2013309 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"9426_CR7","doi-asserted-by":"crossref","first-page":"1909\u20131925","DOI":"10.1137\/S009753979732058X","volume":"31","author":"N. Bshouty","year":"2002","unstructured":"Bshouty, N., Mansour, Y.: Simple learning algorithms for decision trees and multivariate polynomials. SIAM J. Comput. 31(6), 1909\u20131925 (2002)","journal-title":"SIAM J. Comput."},{"key":"9426_CR8","doi-asserted-by":"crossref","unstructured":"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.\u00a0549\u2013558 (2007)","DOI":"10.1109\/FOCS.2007.32"},{"key":"9426_CR9","unstructured":"Ehrenfeucht, A., Karpinski, M.: The computational complexity of (XOR, AND)-counting problems. Technical report. Preprint (1989)"},{"key":"9426_CR10","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: a primer to property testing. Comput. Complex. Column Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97\u2013126 (2001)","journal-title":"Comput. Complex. Column Bull. Eur. Assoc. Theor. Comput. Sci."},{"issue":"1","key":"9426_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0221014","volume":"21","author":"P. Fischer","year":"1992","unstructured":"Fischer, P., Simon, H.U.: On learning ring-sum expansions. SIAM J. Comput. 21(1), 181\u2013192 (1992)","journal-title":"SIAM J. Comput."},{"key":"9426_CR12","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.jcss.2003.11.004","volume":"68","author":"E. Fischer","year":"2004","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Comput. Syst. Sci. 68, 753\u2013787 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9426_CR13","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwaser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653\u2013750 (1998)","journal-title":"J. ACM"},{"issue":"6","key":"9426_CR14","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0219073","volume":"19","author":"D. Grigoriev","year":"1990","unstructured":"Grigoriev, D., Karpinski, M., Singer, M.: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput. 19(6), 1059\u20131063 (1990)","journal-title":"SIAM J. Comput."},{"key":"9426_CR15","doi-asserted-by":"crossref","unstructured":"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.\u00a068\u201380 (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"9426_CR16","unstructured":"Karpinski, M.: Boolean circuit complexity of algebraic interpolation problems. TR-89-027 (1989)"},{"key":"9426_CR17","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jagm.1993.1014","volume":"14","author":"M. Karpinski","year":"1993","unstructured":"Karpinski, M., Luby, M.: Approximating the number of zeros of a GF[2] polynomial. J. Algorithms 14, 280\u2013287 (1993)","journal-title":"J. Algorithms"},{"key":"9426_CR18","doi-asserted-by":"crossref","unstructured":"Luby, M., Velickovic, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Proceedings of the 2nd ISTCS, pp. 18\u201324 (1993)","DOI":"10.1109\/ISTCS.1993.253488"},{"issue":"2","key":"9426_CR19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/S0097539792239291","volume":"24","author":"Y. Mansour","year":"1995","unstructured":"Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. SIAM J. Comput. 24(2), 357\u2013368 (1995)","journal-title":"SIAM J. Comput."},{"key":"9426_CR20","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.: Testing halfspaces. Technical Report 128, Electronic Colloquium in Computational Complexity (2007)"},{"key":"9426_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"9426_CR22","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/S0895480101407444","volume":"16","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Discrete Math. 16, 20\u201346 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"9426_CR23","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"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.\u00a0II. Kluwer Academic, Norwell (2001)"},{"key":"9426_CR24","doi-asserted-by":"crossref","unstructured":"Ron, D.: Property testing: a\u00a0learning theory perspective. COLT 2007 Invited Talk, slides available at http:\/\/www.eng.tau.ac.il\/danar\/Public-ppt\/colt07.ppt (2007)","DOI":"10.1561\/9781601981837"},{"issue":"2","key":"9426_CR25","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/0220019","volume":"20","author":"R. Roth","year":"1991","unstructured":"Roth, R., Benedek, G.: Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM J. Comput. 20(2), 291\u2013314 (1991)","journal-title":"SIAM J. Comput."},{"key":"9426_CR26","unstructured":"Rubinfeld, R.: Sublinear time algorithms. In: Proceedings of the International Congress of Mathematicians, ICM, 2006"},{"issue":"2","key":"9426_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/jcss.1996.0017","volume":"52","author":"R. Schapire","year":"1996","unstructured":"Schapire, R., Sellie, L.: Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. Syst. Sci. 52(2), 201\u2013213 (1996)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9426-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9426-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9426-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:26:08Z","timestamp":1740259568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9426-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,13]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9426"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9426-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2010,7,13]]}}}