{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:27Z","timestamp":1725889887582},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_35","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T08:33:54Z","timestamp":1156494834000},"page":"375-385","source":"Crossref","is-referenced-by-count":4,"title":["Local Decoding and Testing for Homomorphisms"],"prefix":"10.1007","author":[{"given":"Elena","family":"Grigorescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swastik","family":"Kopparty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Ben-Or","year":"2004","unstructured":"Ben-Or, M., Coppersmith, D., Luby, M., Rubinfeld, R.: Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122. Springer, Heidelberg (2004)"},{"issue":"6","key":"35_CR2","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"},{"issue":"3","key":"35_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. Journal of Computer and System Sciences\u00a047(3), 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S0895480198344540","volume":"13","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: The highly noisy case. SIAM Journal on Discrete Mathematics\u00a013(4), 535\u2013570 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: List decoding algorithms for certain concatenated codes. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 181\u2013190 (2000)","DOI":"10.1145\/335305.335327"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45878-6_2","volume-title":"Theoretical Aspects of Computer Science","author":"M. Kiwi","year":"2002","unstructured":"Kiwi, M., Magniez, F., Santha, M.: Exact and approximate testing\/correcting of algebraic functions: A survey. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, M.A. (eds.) Theoretical Aspects of Computer Science 2000. LNCS, vol.\u00a02292, pp. 30\u201383. Springer, Heidelberg (2002)"},{"issue":"1\u20133","key":"35_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(02)00816-2","volume":"299","author":"M. Kiwi","year":"2003","unstructured":"Kiwi, M.: Testing and weight distributions of dual codes. Theoretical Computer Science\u00a0299(1\u20133), 81\u2013106 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"35_CR9","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SIAM Journal on Computing\u00a022(6), 1331\u20131348 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Moshkovitz, D., Raz, R.: Sub-Constant Error Low Degree Test of Almost Linear Size. In: STOC 2006 (2006)","DOI":"10.1145\/1132516.1132520"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 537\u2013546 (1999)","DOI":"10.1109\/CCC.1999.766253"},{"key":"35_CR12","unstructured":"Sudan, M.: Algorithmic Introduction to Coding Theory. Lecture Notes (2001)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Wigderson, A.: Derandomizing Homomorphism Testing in General Groups. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 427\u2013435 (2004)","DOI":"10.1145\/1007352.1007421"},{"key":"35_CR14","first-page":"347","volume":"13","author":"L. Trevisan","year":"2004","unstructured":"Trevisan, L.: Some Applications of Coding Theory in Computational Complexity. Survey Paper. Quaderni di Matematica\u00a013, 347\u2013424 (2004)","journal-title":"Quaderni di Matematica"}],"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\/11830924_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:38Z","timestamp":1619493218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11830924_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}