{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:05:08Z","timestamp":1725563108731},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_32","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:01:36Z","timestamp":1282867296000},"page":"420-433","source":"Crossref","is-referenced-by-count":4,"title":["Low Rate Is Insufficient for Local Testability"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Viderman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/CCC.2009.6","volume-title":"IEEE Conference on Computational Complexity","author":"E. Ben-Sasson","year":"2009","unstructured":"Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. In: IEEE Conference on Computational Complexity, pp. 52\u201361. IEEE Computer Society, Los Alamitos (2009)"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF properties are hard to test. SIAM Journal on Computing\u00a035(1), 1\u201321 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E. Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPs with polylog query complexity. SIAM J. Comput.\u00a038(2), 551\u2013607 (2008)","journal-title":"SIAM J. Comput."},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-03685-9_29","volume-title":"APPROX-RANDOM","author":"E. Ben-Sasson","year":"2009","unstructured":"Ben-Sasson, E., Viderman, M.: Composition of semi-LTCs by two-wise tensor products. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) APPROX-RANDOM. LNCS, vol.\u00a05687, pp. 378\u2013391. Springer, Heidelberg (2009)"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1002\/rsa.20069","volume":"27","author":"A. Deshpande","year":"2005","unstructured":"Deshpande, A., Jain, R., Kavitha, T., Lokam, S.V., Radhakrishnan, J.: Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms\u00a027(3), 358\u2013378 (2005)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"32_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM\u00a054(3), 12:1\u201312:44 (2007)","journal-title":"Journal of the ACM"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC, pp. 80\u201386 (2000)","DOI":"10.1145\/335305.335315"},{"key":"32_CR8","first-page":"590","volume-title":"FOCS","author":"T. Kaufman","year":"2007","unstructured":"Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS, pp. 590\u2013600. IEEE Computer Society, Los Alamitos (2007)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/978-3-642-03685-9_45","volume-title":"APPROX-RANDOM","author":"S. Kopparty","year":"2009","unstructured":"Kopparty, S., Saraf, S.: Tolerant linearity testing and locally testable codes. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) APPROX-RANDOM. LNCS, vol.\u00a05687, pp. 601\u2013614. Springer, Heidelberg (2009)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/1806689.1806748","volume-title":"STOC","author":"S. Kopparty","year":"2010","unstructured":"Kopparty, S., Saraf, S.: Local list-decoding and testing of random linear codes from high error. In: Mitzenmacher, M., Schulman, L.J. (eds.) STOC, pp. 417\u2013426. ACM, New York (2010)"},{"key":"32_CR11","first-page":"285","volume-title":"STOC","author":"O. Meir","year":"2008","unstructured":"Meir, O.: Combinatorial construction of locally testable codes. In: STOC, pp. 285\u2013294. ACM, New York (2008)"},{"key":"32_CR12","unstructured":"Trevisan, L.: Some applications of coding theory in computational complexity (September 23, 2004)"}],"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-642-15369-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:51:25Z","timestamp":1619772685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}