{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T05:11:33Z","timestamp":1744348293039},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_19","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"216-227","source":"Crossref","is-referenced-by-count":15,"title":["Bounds on 2-Query Codeword Testing"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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 Intractability of Approximation Problems. Journal of the ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free Bits, PCPs and Non-Approximability \u2013 Towards Tight Results. SIAM Journal on Computing\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Goldreich, O., Sudan, M.: Bounds on 2-Query Codeword Testing. ECCC, TR03-019 (2003)","DOI":"10.1007\/978-3-540-45198-3_19"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3-CNF Properties are Hard to Test. In: 35th STOC (2003)","DOI":"10.1145\/780542.780594"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Friedl, K., Sudan, M.: Some Improvements to Total Degree Tests. In: Proc. of ISTCS, pp. 190\u2013198 (1995)","DOI":"10.1109\/ISTCS.1995.377032"},{"issue":"4","key":"19_CR6","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(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sudan, M.: Locally Testable Codes and PCPs of Almost-Linear Length. In: 43rd FOCS, pp. 13\u201322 (2002)","DOI":"10.1109\/SFCS.2002.1181878"},{"key":"19_CR8","unstructured":"Kiwi, M.: Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes. Ph.D. Thesis, MIT (1996)"},{"issue":"2","key":"19_CR9","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"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:05:11Z","timestamp":1559930711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}