{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:21Z","timestamp":1725474981136},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_28","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"267-276","source":"Crossref","is-referenced-by-count":6,"title":["On 2-Query Codeword Testing with Near-Perfect Completeness"],"prefix":"10.1007","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and application to coding. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (2004)","DOI":"10.1145\/1007352.1007361"},{"key":"28_CR2","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":"28_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02785861","volume":"131","author":"J. Bourgain","year":"2002","unstructured":"Bourgain, J.: On the distribution of the Fourier spectrum of boolean functions. Israel Journal of Mathematics\u00a0131, 269\u2013276 (2002)","journal-title":"Israel Journal of Mathematics"},{"key":"28_CR4","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Note on Max2SAT. Technical Report TR06-064, Electronic Colloquium on Computational Complexity (2006)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Reingold, O.: Assignment Testers: Towards a combinatorial proof of the PCP-Theorem. In: Proceedings of 45th Annual Symposium on Foundations of Computer Science (FOCS), pp. 155\u2013164 (2004)","DOI":"10.1109\/FOCS.2004.16"},{"key":"28_CR6","unstructured":"Goldreich, O.: Short locally testable codes and proofs (Survey). ECCC Technical Report TR05-014 (2005)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost linear length. In: Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pp. 13\u201322 (2002)","DOI":"10.1109\/SFCS.2002.1181878"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), pp. 767\u2013775 (May 2002)","DOI":"10.1145\/509907.510017"},{"key":"28_CR10","unstructured":"Mossel, E., O\u2019Donnell, R., Oleszkiewicz, K.: Noise stability of functions with low influences: invariance and optimality. In: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 21\u201330 (2005)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Zwick, U.: Finding almost satisfying assignments. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pp. 551\u2013560 (May 1998)","DOI":"10.1145\/276698.276869"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:50Z","timestamp":1619509790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11940128_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}