{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:40:53Z","timestamp":1781077253278,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407706","type":"print"},{"value":"9783540451983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_17","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"188-199","source":"Crossref","is-referenced-by-count":47,"title":["Testing Low-Degree Polynomials over GF(2)"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tali","family":"Kaufman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dana","family":"Ron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. In: Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pp. 645\u2013655 (1999)","DOI":"10.1109\/SFFCS.1999.814641"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Improved low-degree testing and its applications. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp. 485\u2013495 (1997)","DOI":"10.1145\/258533.258642"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 21\u201331 (1991)","DOI":"10.1145\/103418.103428"},{"issue":"1","key":"17_CR4","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":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Coppersmith, D., H\u00e5stad, J., Kiwi, M., Sudan, M.: Linearity testing in characteristic two. In: Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science, pp. 432\u2013441 (1995)","DOI":"10.1109\/SFCS.1995.492574"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pp. 294\u2013304 (1993)","DOI":"10.1145\/167088.167174"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Sudan, M.: Improved non-approximability results. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pp. 184\u2013193 (1994)","DOI":"10.1145\/195058.195129"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: 3CNF properties are hard to test. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing (2003) (to appear)","DOI":"10.1145\/780542.780594"},{"key":"17_CR9","unstructured":"Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Derandomizing low degree tests via epsilon-biased spaces. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing (2003) (to appear)"},{"key":"17_CR10","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. Journal of Computer and System Sciences\u00a047, 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-complete. Journal of the Association for Computing Machinery, 268\u2013292 (1996)","DOI":"10.1145\/226643.226652"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Friedl, K., Sudan, M.: Some improvements to total degree tests. In: Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, pp. 190\u2013198 (1995), Corrected version available online at http:\/\/theory.lcs.mit.edu\/~madhu\/papers\/friedl.ps","DOI":"10.1109\/ISTCS.1995.377032"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self-testing\/correcting for polynomials and for approximate functions. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 32\u201342 (1991)","DOI":"10.1145\/103418.103429"},{"key":"17_CR14","volume-title":"Combinatorial Theory","author":"M. Hall","year":"1967","unstructured":"Hall, M.: Combinatorial Theory. John Wiley & Sons, Chichester (1967)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Kasami, T., Lin, S., Peterson, W.W.: New generalizations of the reed-muller codes, part i: Primitive codes. IEEE Transactions on Information Theory, 189\u2013199 (1968)","DOI":"10.1109\/TIT.1968.1054127"},{"key":"17_CR16","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR18","unstructured":"Sudan, M.: Private communications (1995)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:52:26Z","timestamp":1740840746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}