{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:04Z","timestamp":1740548044547,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228943"},{"type":"electronic","value":"9783540278214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_26","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"286-297","source":"Crossref","is-referenced-by-count":11,"title":["Robust Locally Testable Codes and Products of Codes"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. In: Proc. RANDOM 2003, pp. 188\u2013199 (2003)","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"26_CR2","unstructured":"Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley (1994)"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proc. STOC 1997, El Paso, Texas, May 4-6, pp. 485\u2013495 (1997)","DOI":"10.1145\/258533.258642"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proc. STOC 1991, pp. 21\u201332 (1991)","DOI":"10.1145\/103418.103428"},{"issue":"1","key":"26_CR7","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"},{"issue":"6","key":"26_CR8","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":"26_CR9","first-page":"294","volume-title":"Proc. STOC 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximation. In: Proc. STOC 1993, pp. 294\u2013304. ACM, New York (1993)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Bellareand, M., Sudan, M.: Improved non-approximability results. In: Proc. STOC 1994, Montreal, Quebec, Canada, May 23-25, pp. 184\u2013193 (1994)","DOI":"10.1145\/195058.195129"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and applications to coding. In: Proc. STOC0 (2004) (to appear)","DOI":"10.1145\/1007352.1007361"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M.: Robust Locally Testable Codes and Products of Codes. Electronic Colloquium on Computational Complexity, Available at http:\/\/eccc.uni-trier.de\/eccc-reports\/2004\/TR04-046\/index.html","DOI":"10.1007\/978-3-540-27821-4_26"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness efficient low-degree tests and short PCPs via -biased sets. In: Proc. STOC 2003, pp. 612\u2013621 (2003)","DOI":"10.1145\/780542.780631"},{"issue":"3","key":"26_CR14","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":"26_CR15","unstructured":"Dinur, I., Reingold, O.: Assignment-Testers: Towards a Combinatorial. Proof of the PCP-Theorem (2004) (manuscript)"},{"issue":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lovasz, 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":"26_CR17","unstructured":"Friedl, K., Hatsagi, Z., Shen, A.: Low-degree tests. In: Proc. SODA 1994, pp. 57\u201364 (1994)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Friedl, K., Sudan, M.: Some improvements to total degree tests. In: Proc. Israel STCS, Tel Aviv, Israel, January 4-6, pp. 190\u2013198 (1995)","DOI":"10.1109\/ISTCS.1995.377032"},{"issue":"4","key":"26_CR19","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/S0097539797315744","volume":"29","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Safra, M.: A Combinatorial Consistency Lemma with application to the PCP Theorem. SIAM Jour. on Comp.\u00a029(4), 1132\u20131154 (1999)","journal-title":"SIAM Jour. on Comp."},{"key":"26_CR20","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almostlinear length. In: Proc. FOCS 2002, Vancouver, Canada, 16-19 November (2002)"},{"key":"26_CR21","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1981","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier\/North-Holland, Amsterdam (1981)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Polishchuk, A., Spielman, D.A.: Nearly linear-size holographic proofs. In: Proc. STOC 1994, Montreal, Canada, pp. 194\u2013203 (1994)","DOI":"10.1145\/195058.195132"},{"key":"26_CR23","first-page":"475","volume-title":"Proc. STOC 1997","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. STOC 1997, pp. 475\u2013484. ACM Press, New York (1997)"},{"issue":"2","key":"26_CR24","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. Comp.\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comp."},{"key":"26_CR25","unstructured":"Sudan, M.: Algorithmic introduction to coding theory. Lecture notes (2001), Available from http:\/\/theory.csail.mit.edu\/~madhu\/FT01\/"},{"issue":"5","key":"26_CR26","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R. Michael Tanner","year":"1981","unstructured":"Michael Tanner, R.: A recursive approach to low complexity codes. IEEE Transactions of Information Theory\u00a027(5), 533\u2013547 (1981)","journal-title":"IEEE Transactions of Information Theory"}],"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-27821-4_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:41:12Z","timestamp":1740516072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}