{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:31Z","timestamp":1742913511673,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_56","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"686-697","source":"Crossref","is-referenced-by-count":4,"title":["Sound 3-Query PCPPs Are Long"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prahladh","family":"Harsha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Matsliah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"56_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 the hardness of approximation problems. Journal ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal ACM"},{"issue":"1","key":"56_CR2","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\u00a0NP. Journal ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal ACM"},{"issue":"6","key":"56_CR3","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.A., Sudan, M.: Linearity testing in characteristic two. IEEE Transactions on Information Theory\u00a042(6), 1781\u20131795 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"56_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and applications to coding. SICOMP\u00a036(4), 889\u2013974 (2006)","journal-title":"SICOMP"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Harsha, P., Lachish, O., Matsliah, A.: Sound 3-query PCPPs are long. Technical Report TR07-127, ECCC (2007)","DOI":"10.1007\/978-3-540-70575-8_56"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: Proc. 37th ACM STOC, Baltimore, Maryland, pp. 266\u2013275.","DOI":"10.1145\/1060590.1060631"},{"issue":"3","key":"56_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal ACM\u00a054(3), 12 (2007)","journal-title":"Journal ACM"},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/S0097539705446962","volume":"36","author":"I. Dinur","year":"2006","unstructured":"Dinur, I., Reingold, O.: Assignment testers: Towards a combinatorial proof of the PCP Theorem. SICOMP\u00a036, 975\u20131024 (2006)","journal-title":"SICOMP"},{"issue":"2","key":"56_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ic.2003.09.005","volume":"189","author":"F. Erg\u00fcn","year":"2004","unstructured":"Erg\u00fcn, F., Kumar, R., Rubinfeld, R.: Fast approximate probabilistically checkable proofs. Information and Computation\u00a0189(2), 135\u2013159 (2004)","journal-title":"Information and Computation"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Fischer, E., Fortnow, L.: Tolerant versus intolerant testing for boolean properties. In: Proc. 20th IEEE CCC, San Jose, California, pp. 135\u2013140.","DOI":"10.1109\/CCC.2005.30"},{"key":"56_CR11","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science\u00a075, 97\u2013126 (2001); The Computational Complexity Column","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"4","key":"56_CR12","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 ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal ACM"},{"key":"56_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/11538462_26","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Rudra, A.: Tolerant locally testable codes. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 306\u2013317. Springer, Heidelberg (2005)"},{"issue":"6","key":"56_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal ACM\u00a046(6), 787\u2013832 (1999)","journal-title":"Journal ACM"},{"issue":"6","key":"56_CR15","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.jcss.2006.03.002","volume":"72","author":"M. Parnas","year":"2006","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. Journal of Computer and System Sciences\u00a072(6), 1012\u20131042 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"56_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/3-540-48523-6_64","volume-title":"Automata, Languages and Programming","author":"M. Szegedy","year":"1999","unstructured":"Szegedy, M.: Many-valued logics and holographic proofs. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 676\u2013686. Springer, Heidelberg (1999)"},{"key":"56_CR17","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Approximation algorithms for unique games. In: Proc. 46th IEEE FOCS, Pittsburgh, Pennsylvania, pp. 197\u2013205","DOI":"10.1109\/SFCS.2005.22"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:12Z","timestamp":1738325592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}