{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:28Z","timestamp":1725567568947},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_21","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"280-288","source":"Crossref","is-referenced-by-count":1,"title":["Composition of Low-Error 2-Query PCPs Using Decodable PCPs"],"prefix":"10.1007","author":[{"given":"Irit","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prahladh","family":"Harsha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_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. J. ACM\u00a045(3), 501\u2013555 (1998); Preliminary Version in 33rd FOCS (1992), eccc: TR98-008, doi:10.1145\/278298.278306","journal-title":"J. ACM"},{"issue":"1","key":"21_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. J. ACM\u00a045(1), 70\u2013122 (1998), doi:10.1145\/273865.273901","journal-title":"J. ACM"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00493-003-0025-0","volume":"23","author":"S. Arora","year":"2003","unstructured":"Arora, S., Sudan, M.: Improved low-degree testing and its applications. Combinatorica\u00a023(3), 365\u2013426 (2003); Preliminary Version in 29th STOC (1997), eccc: TR97-003, doi:10.1007\/s00493-003-0025-0","journal-title":"Combinatorica"},{"issue":"4","key":"21_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. SIAM J. Computing\u00a036(4), 889\u2013974 (2006); Preliminary Version in 36th STOC (2004), eccc: TR04-021, doi:10.1137\/S0097539705446810","journal-title":"SIAM J. Computing"},{"key":"21_CR5","first-page":"294","volume-title":"Proc. 25th ACM Symp. on Theory of Computing (STOC)","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximation. In: Proc. 25th ACM Symp. on Theory of Computing (STOC), pp. 294\u2013304. ACM, New York (1993), doi:10.1145\/167088.167174"},{"key":"21_CR6","unstructured":"Bogdanov, A.: Gap amplification fails below 1\/2 (2005) (Comment on \u201dDinur, The PCP theorem by gap amplification), eccc:TR05-046"},{"issue":"2","key":"21_CR7","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. Computing\u00a038(2), 551\u2013607 (2008); Preliminary Version in 37th STOC (2005), eccc:TR04-060, doi:10.1137\/050646445","journal-title":"SIAM J. Computing"},{"key":"21_CR8","first-page":"29","volume-title":"Proc. 31st ACM Symp. on Theory of Computing (STOC)","author":"I. Dinur","year":"1999","unstructured":"Dinur, I., Fischer, E., Kindler, G., Raz, R., Safra, S.: PCP characterizations of NP: Towards a polynomially-small error-probability. In: Proc. 31st ACM Symp. on Theory of Computing (STOC), pp. 29\u201340. ACM, New York (1999), eccc:TR98-066, doi:10.1145\/301250.301265"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Dinur, I., Harsha, P.: Composition of low-error 2-query PCPs using decodable PCPs. Technical Report TR09-042, Electronic Colloquium on Computational Complexity (2009), eccc:TR09-042","DOI":"10.1109\/FOCS.2009.8"},{"issue":"3","key":"21_CR10","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. J. ACM\u00a054(3), 12 (2007); Preliminary Version in 38th STOC (2006), eccc: TR05-046, doi:10.1145\/1236457.1236459","journal-title":"J. ACM"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1412700.1412713","volume":"39","author":"I. Dinur","year":"2008","unstructured":"Dinur, I.: PCPs with small soundness error. SIGACT News\u00a039(3), 41\u201357 (2008), doi:10.1145\/1412700.1412713","journal-title":"SIGACT News"},{"key":"21_CR12","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. SIAM J. Computing\u00a036, 975\u20131024 (2006), doi:10.1137\/S0097539705446962","journal-title":"SIAM J. Computing"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM\u00a043(2), 268\u2013292 (1996); Preliminary version in 32nd FOCS (1991), doi:10.1145\/226643.226652","journal-title":"J. ACM"},{"key":"21_CR14","first-page":"457","volume-title":"Proc. 27th ACM Symp. on Theory of Computing (STOC)","author":"U. Feige","year":"1995","unstructured":"Feige, U., Kilian, J.: Impossibility results for recycling random bits in two-prover proof systems. In: Proc. 27th ACM Symp. on Theory of Computing (STOC), pp. 457\u2013468. ACM, New York (1995), doi:10.1145\/225058.225183"},{"key":"21_CR15","volume-title":"Concatenated Codes","author":"G. David Forney","year":"1966","unstructured":"David Forney, G.: Concatenated Codes. MIT Press, Cambridge (1966)"},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001); Preliminary Version in 29th STOC (1997), doi:10.1145\/502090.502098","journal-title":"J. ACM"},{"key":"21_CR17","first-page":"131","volume-title":"Proc. 41st ACM Symp. on Theory of Computing (STOC)","author":"R. Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Kabanets, V., Wigderson, A.: Direct product testing: Improved and derandomized. In: Proc. 41st ACM Symp. on Theory of Computing (STOC), pp. 131\u2013140. ACM, New York (2009), eccc:TR09-090, doi:10.1145\/1536414.1536435"},{"key":"21_CR18","unstructured":"Moshkovitz, D., Raz, R.: Sub-constant error probabilistically checkable proof of almost linear size (2007), eccc:TR07-026"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/060656838","volume":"38","author":"D. Moshkovitz","year":"2008","unstructured":"Moshkovitz, D., Raz, R.: Sub-constant error low degree test of almost-linear size. SIAM J. Computing\u00a038(1), 140\u2013180 (2008); Preliminary Version in 38th STOC (2006), eccc:TR05-086, doi:10.1137\/060656838","journal-title":"SIAM J. Computing"},{"key":"21_CR20","first-page":"314","volume-title":"Proc. 49th IEEE Symp. on Foundations of Comp. Science (FOCS)","author":"D. Moshkovitz","year":"2008","unstructured":"Moshkovitz, D., Raz, R.: Two query PCP with sub-constant error. In: Proc. 49th IEEE Symp. on Foundations of Comp. Science (FOCS), pp. 314\u2013323. IEEE, Los Alamitos (2008), eccc:TR08-071, doi:10.1109\/FOCS.2008.60"},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM J. Computing\u00a027(3), 763\u2013803 (1998); Preliminary Version in 27th STOC (1995), doi:10.1137\/S0097539795280895","journal-title":"SIAM J. Computing"},{"key":"21_CR22","first-page":"475","volume-title":"Proc. 29th ACM Symp. on Theory of Computing (STOC)","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\u00a0NP. In: Proc. 29th ACM Symp. on Theory of Computing (STOC), pp. 475\u2013484. ACM, New York (1997), doi:10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T09:10:55Z","timestamp":1559725855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}