On 2-query codeword testing with near-perfect completeness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4288 LNCS, Issue , 2006, Pages 267-276

  Guruswami, Venkatesan ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; APX-HARDNESS; CODE-WORDS; CODEWORD; CONSTANT FACTORS; NON-TRIVIAL; POLYNOMIAL-TIME; RELATIVE DISTANCES; UNIQUE GAMES CONJECTURE;

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY;

HARDNESS TESTING;

EID: 70350666296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_28     Document Type: Conference Paper

References (11)

1. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and application to coding. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 1-10, 2004.
2. E. Ben-Sasson, O. Goldreich, and M. Sudan. Bounds on 2-query codeword testing. In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 216-227, 2003.
3. J. Bourgain. On the distribution of the Fourier spectrum of boolean functions. Israel Journal of Mathematics, 131:269-276, 2002.
4. M. Charikar, K. Makarychev, and Y. Makarychev. Note on Max2SAT. Technical Report TR06-064, Electronic Colloquium on Computational Complexity, 2006.
5. I. Dinur and O. Reingold. Assignment Testers: Towards a combinatorial proof of the PCP-Theorem. In Proceedings of 45th Annual Symposium on Foundations of Computer Science (FOCS), pages 155-164, 2004.
6. O. Goldreich. Short locally testable codes and proofs (Survey). ECCC Technical Report TR05-014, 2005.
7. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost linear length. In Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pages 13-22, 2002.
8. V. Guruswami and A. Rudra. Tolerant locally testable codes. In Proceedings of the 9th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 306-317, 2005.
9. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), pages 767-775, May 2002.
10. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2005.
11. U. Zwick. Finding almost satisfying assignments. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pages 551-560, May 1998.