A 3-query non-adaptive PCP with perfect completeness

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 159-169

  Khot, Subhash ^a   Saket, Rishi ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CONSTRAINT THEORY; FOURIER TRANSFORMS; PROBLEM SOLVING; STATISTICAL TESTS;

BASIC OPEN PROBLEM; NONADAPTIVE QUERIES; QUERY TESTS;

FORMAL LANGUAGES;

EID: 34247534691     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.5     Document Type: Conference Paper

References (15)

1. S. Arora, C. Lund, R. Motawani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs : A new characterization of NP. Journal, of the ACM, 45(1):70-122, 1998.
3. M. Bellare and M. Sudan. Improved non-approximability results. In Proc. of the 26th Annual. ACM Symposium on Theory of Computing, pages 184-193, 1994
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, pcps and non-approximability. Electronic Colloquium on Computational Complexity, Technical Report TR95-024, 1995.
5. I. Dinur, V. Guruswami, S. Khot and O. Regev. Vertex cover in k-uniform hypergraphs is hard to approximate within k - 1 - ε. Manuscript, 2002.
6. I. Dinur and S. Safra. Importance of being biased. In Proc. of the 34th Annual ACM Symposium on Theory of Computing, 2002.
7. I. Dinur, O. Regev and C. Smyth. On the hardness of coloring 3-uniform hyper-graphs. In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science, 2002.
8. E. Friedgut. Boolean functions with low average sensitivity depend on few coordinates. Combinatorica, Vol 18 (1), 1998, pages 27-36.
9. V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan. A new characterization of NP with 3 query PCPs. In Proc. of 39th Annual IEEE Symposium of Foundations of Computer Science, 1998.
10. 1-ε. In Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 627-636, 1996.
11. J. Håstad. Some optimal inapproximability results. In Proc. of the 29th Annual ACM Symposium on Theory of Computing, pages 1-10, 1997.
12. S. Khot. Hardness of coloring 3-colorable 3-uniform hypergraphs. In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science, 2002.
13. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
14. A. Samorodnitsky, and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. of the 32nd Annual ACM Symposium on Theory of Computing, pages 191-199, 2000.
15. U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.