{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:08Z","timestamp":1763467928656},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_29","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T02:39:51Z","timestamp":1250822391000},"page":"378-391","source":"Crossref","is-referenced-by-count":14,"title":["Composition of Semi-LTCs by Two-Wise Tensor Products"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Viderman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"29_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., Mutwani, R., Sudan, M., Szegedy, M.: Proof verification and Intractability of Approximation Problems. Journal of ACM\u00a045(3), 501\u2013555 (1998); Preliminary version in FOCS, pp. 14\u201323 (1992)","journal-title":"Journal of ACM"},{"issue":"4","key":"29_CR2","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 Journal of Computing\u00a036(4), 889\u2013974 (2006); Preliminary version in STOC 2004, pp. 120\u2013134","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF Properties are Hard to Test. SIAM Journal on Computing\u00a035(1), 1\u201321 (2005); Preliminary version appeared in STOC 2003","journal-title":"SIAM Journal on Computing"},{"key":"29_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-27821-4_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E. Ben-Sasson","year":"2004","unstructured":"Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX-RANDOM 2004. LNCS, vol.\u00a03122, pp. 286\u2013297. Springer, Heidelberg (2004) (See ECCC TR04-046, 2004)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPs with Poly-log Rate and Query Complexity. In: STOC 2005, pp. 266\u2013275 (2005); Full version can be obtained from Eli Ben-Sasson\u2019s homepage at \n                    \n                      http:\/\/www.cs.technion.ac.il\/~eli\/","DOI":"10.1145\/1060590.1060631"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-85363-3_24","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Viderman, M.: Tensor products of weakly smooth codes are robust. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX-RANDOM 2008. LNCS, vol.\u00a05171, pp. 290\u2013302. Springer, Heidelberg (2008)"},{"issue":"3","key":"29_CR7","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 Science\u00a047(3), 549\u2013595 (1993)","journal-title":"Journal of Computer and System Science"},{"key":"29_CR8","unstructured":"Copersmith, D., Rudra, A.: On the robust testability of tensor products of codes, ECCC TR05-104 2005 (2005)"},{"key":"#cr-split#-29_CR9.1","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP Theorem by gap amplification. Journal of ACM 54(3) (2007)","DOI":"10.1145\/1236457.1236459"},{"key":"#cr-split#-29_CR9.2","unstructured":"Preliminary version in STOC 2006, pp. 241-250"},{"issue":"4","key":"29_CR10","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 combinatorial proofs of the PCP theorem. SIAM Journal of Computing\u00a036(4), 975\u20131024 (2006); Preliminary version in FOCS 2004, pp. 155\u2013164","journal-title":"SIAM Journal of Computing"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11830924_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I. Dinur","year":"2006","unstructured":"Dinur, I., Sudan, M., Wigderson, A.: Robust local testability of tensor products of LDPC codes. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX-RANDOM 2006. LNCS, vol.\u00a04110, pp. 304\u2013315. Springer, Heidelberg (2006)"},{"key":"29_CR12","unstructured":"Goldreich, O.: Short locally testable codes and proofs (survey), ECCC TR05-014 (2005)"},{"key":"29_CR13","unstructured":"Goldreich, O., Meir, O.: The tensor product of two good codes is not necessarily robustly testable. In: ECCC TR 2007 (2007)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS 2007 (2007)","DOI":"10.1109\/FOCS.2007.8"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Sudan, M.: Algebraic Property Testing: The role of Invariance, ECCC Technical Report, TR07-111 (2007)","DOI":"10.1145\/1374376.1374434"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Meir, O.: Combinatorial Construction of Locally Testable Codes. M.Sc. Thesis, Weizmann Institute of Science (2007)","DOI":"10.1145\/1374376.1374419"},{"key":"29_CR17","first-page":"347","volume":"13","author":"L. Trevisan","year":"2004","unstructured":"Trevisan, L.: Some Applications of Coding Theory in Computational Complexity, Survey Paper. Quaderni di Matematica\u00a013, 347\u2013424 (2004)","journal-title":"Quaderni di Matematica"},{"key":"29_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/11538462_40","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"P. Valiant","year":"2005","unstructured":"Valiant, P.: The tensor product of two codes is not necessarily robustly testable. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM 2005. LNCS, vol.\u00a03624, pp. 472\u2013481. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:15:33Z","timestamp":1558282533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}