{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:16:23Z","timestamp":1774941383501,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_41","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"502-514","source":"Crossref","is-referenced-by-count":5,"title":["Efficiently Testing Sparse GF(2) Polynomials"],"prefix":"10.1007","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[]},{"given":"Homin K.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Matulef","sequence":"additional","affiliation":[]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Proc. RANDOM, pp. 188\u2013199 (2003)","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"41_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"41_CR3","doi-asserted-by":"publisher","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. Comp. Sys. Sci\u00a047, 549\u2013595 (1993); Earlier version in STOC 1990","journal-title":"J. Comp. Sys. Sci"},{"issue":"6","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1909","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.\u00a031(6), 1909\u20131925 (2002)","journal-title":"SIAM J. Comput."},{"key":"41_CR5","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. 144\u2013153 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50014-X"},{"issue":"3","key":"41_CR6","doi-asserted-by":"publisher","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. Information Processing Letters\u00a061(3), 303\u2013309 (1997)","journal-title":"Information Processing Letters"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF01262930","volume":"6","author":"N. Bshouty","year":"1997","unstructured":"Bshouty, N.: Simple learning algorithms using divide and conquer. Computational Complexity\u00a06, 174\u2013194 (1997)","journal-title":"Computational Complexity"},{"key":"41_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: Proc. 48th Ann. Symposium on Computer Science (FOCS), pp. 549\u2013558 (2007)","DOI":"10.1109\/FOCS.2007.32"},{"key":"41_CR9","unstructured":"Ehrenfeucht, A., Karpinski, M.: The computational complexity of (xor,and)-counting problems. Technical report (preprint 1989)"},{"key":"41_CR10","doi-asserted-by":"publisher","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. Journal of Computer & System Sciences\u00a068, 753\u2013787 (2004)","journal-title":"Journal of Computer & System Sciences"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","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 Journal on Computing\u00a021(1), 181\u2013192 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR12","doi-asserted-by":"publisher","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. Journal of the ACM\u00a045, 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"issue":"6","key":"41_CR13","doi-asserted-by":"publisher","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 Journal on Computing\u00a019(6), 1059\u20131063 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR14","unstructured":"Karpinski, M.: Boolean circuit complexity of algebraic interpolation problems (TR-89-027) (1989)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Kahn, J., Kalai, G., Linial, N.: The influence of variables on boolean functions. In: Proc. 29th FOCS, pp. 68\u201380 (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"41_CR16","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a014, 280\u2013287 (1993)","journal-title":"Journal of Algorithms"},{"key":"41_CR17","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":"41_CR18","doi-asserted-by":"publisher","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 Journal on Computing\u00a024(2), 357\u2013368 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR19","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.: Testing Halfspaces. Technical Report 128, Electronic Colloquium in Computational Complexity (2007)"},{"key":"41_CR20","doi-asserted-by":"publisher","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. Disc. Math.\u00a016, 20\u201346 (2002)","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"41_CR21","doi-asserted-by":"publisher","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.\u00a020(2), 291\u2013314 (1991)","journal-title":"SIAM J. Comput."},{"key":"41_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_1","volume-title":"Learning Theory","author":"D. Ron","year":"2007","unstructured":"Ron, D.: Property testing: A learning theory perspective. In: Bshouty, N.H., Gentile, C. (eds.) COLT. LNCS (LNAI), vol.\u00a04539. Springer, Heidelberg (2007), https:\/\/2.zoppoz.workers.dev:443\/http\/www.eng.tau.ac.il\/~danar\/Public-ppt\/colt07.ppt"},{"issue":"2","key":"41_CR23","doi-asserted-by":"publisher","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.\u00a052(2), 201\u2013213 (1996)","journal-title":"J. Comput. & Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:09Z","timestamp":1738325589000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-540-70575-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":23,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-540-70575-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}