{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086253,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_19","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"269-275","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Testing of Reed-Muller Codes"],"prefix":"10.1007","author":[{"given":"Arnab","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swastik","family":"Kopparty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grant","family":"Schoenebeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Zuckerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Beigel, R.: Lower bounds for approximations by low degree polynomials over Z m . In: IEEE Conference on Computational Complexity, pp. 184\u2013187 (2001)","DOI":"10.1109\/CCC.2001.933885"},{"issue":"11","key":"19_CR2","doi-asserted-by":"publisher","first-page":"4032","DOI":"10.1109\/TIT.2005.856958","volume":"51","author":"N. Alon","year":"2005","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory\u00a051(11), 4032\u20134039 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/18.556674","volume":"42","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Coppersmith, D., H\u00e5stad, J., Kiwi, M., Sudan, M.: Linearity testing over characteristic two. IEEE Transactions on Information Theory\u00a042(6), 1781\u20131795 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR4","unstructured":"Brown, M.V., Calkin, N.J., James, K., King, A.J., Lockard, S., Rhoades, R.C.: Trivial Selmer groups and even partitions of a graph. INTEGERS\u00a06 (December 2006)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity\u00a01(1), 3\u201340 (1991)","journal-title":"Computational Complexity"},{"key":"19_CR6","first-page":"21","volume-title":"Proceedings of the 23rd ACM Symposium on the Theory of Computing","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd ACM Symposium on the Theory of Computing, pp. 21\u201332. ACM Press, New York (1991)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Kopparty, S., Schoenebeck, G., Sudan, M., Zuckerman, D.: Optimal testing of Reed-Muller codes. ECCC Technical Report, TR09-086 (October 2009)","DOI":"10.1109\/FOCS.2010.54"},{"key":"19_CR8","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 (1990)","journal-title":"J. Comp. Sys. Sci."},{"key":"19_CR9","first-page":"57","volume":"26A","author":"R.P. Brent","year":"1988","unstructured":"Brent, R.P., McKay, B.D.: On determinants of random symmetric matrices over \u2124 m . ARS Combinatoria\u00a026A, 57\u201364 (1988)","journal-title":"ARS Combinatoria"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM\u00a043(2), 268\u2013292 (1996)","journal-title":"Journal of the ACM"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, 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"},{"key":"19_CR12","unstructured":"Goldreich, O., Krivelevich, M., Newman, I., Rozenberg, E.: Hierarchy theorems for property testing. Electronic Colloquium on Computational Complexity (ECCC)\u00a015(097) (2008)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s000390050065","volume":"8","author":"W.T. Gowers","year":"1998","unstructured":"Gowers, W.T.: A new proof of Szem\u00e9redi\u2019s theorem for arithmetic progressions of length four. Geometric Functional Analysis\u00a08(3), 529\u2013551 (1998)","journal-title":"Geometric Functional Analysis"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"W.T. Gowers","year":"2001","unstructured":"Gowers, W.T.: A new proof of Szem\u00e9redi\u2019s theorem. Geometric Functional Analysis\u00a011(3), 465\u2013588 (2001)","journal-title":"Geometric Functional Analysis"},{"key":"19_CR15","unstructured":"Green, B., Tao, T.: An inverse theorem for the Gowers U3 norm. arXiv.org:math\/0503014 (2005)"},{"key":"19_CR16","unstructured":"Green, B., Tao, T.: The distribution of polynomials over finite fields, i with applications to the Gowers norms. Technical report (November 2007), http:\/\/arxiv.org\/abs\/0711.3191v1"},{"key":"19_CR17","first-page":"403","volume-title":"STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing","author":"T. Kaufman","year":"2008","unstructured":"Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 403\u2013412. ACM, New York (2008)"},{"key":"19_CR18","first-page":"547","volume-title":"STOC","author":"S. Lovett","year":"2008","unstructured":"Lovett, S., Meshulam, R., Samorodnitsky, A.: Inverse conjecture for the Gowers norm is false. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 547\u2013556. ACM, New York (2008)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. on Comput.\u00a025, 252\u2013271 (1996)","journal-title":"SIAM J. on Comput."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Viola, E., Wigderson, A.: Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols. In: Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007, pp. 141\u2013154 (June 2007)","DOI":"10.1109\/CCC.2007.15"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:18:06Z","timestamp":1740575886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}