{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:22Z","timestamp":1725600322673},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_43","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T05:20:39Z","timestamp":1313126439000},"page":"507-518","source":"Crossref","is-referenced-by-count":4,"title":["Dense Locally Testable Codes Cannot Have Constant Rate and Distance"],"prefix":"10.1007","author":[{"given":"Irit","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tali","family":"Kaufman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: Proc. 37th ACM Symp. on Theory of Computing, pp. 266\u2013275 (2005)","DOI":"10.1145\/1060590.1060631"},{"issue":"7","key":"43_CR2","doi-asserted-by":"publisher","first-page":"3230","DOI":"10.1137\/090779875","volume":"39","author":"E. Ben-Sasson","year":"2010","unstructured":"Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. SIAM J. Comput.\u00a039(7), 3230\u20133247 (2010)","journal-title":"SIAM J. Comput."},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-540-45198-3_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E. Ben-Sasson","year":"2003","unstructured":"Ben-Sasson, E., Goldreich, O., Sudan, M.: Bounds on 2-query codeword testing. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 216\u2013227. Springer, Heidelberg (2003)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM\u00a054(3) (2007)","DOI":"10.1145\/1236457.1236459"},{"issue":"4","key":"43_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/1162349.1162351","volume":"53","author":"O. Goldreich","year":"2006","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. J. ACM\u00a053(4), 558\u2013655 (2006)","journal-title":"J. ACM"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/080729967","volume":"39","author":"O. Meir","year":"2009","unstructured":"Meir, O.: Combinatorial construction of locally testable codes. SIAM J. Comput.\u00a039(2), 491\u2013544 (2009)","journal-title":"SIAM J. Comput."}],"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-22935-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T08:12:10Z","timestamp":1554019930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}