More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 194-205

  Engebretsen, Lars ^a   Holmerin, Jonas ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); PROBABILITY; QUERY LANGUAGES;

COROLLARY; PCP MODELS; QUERY COMPLEXITY; SOUNDNESS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 24144452190     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_16     Document Type: Conference Paper

References (18)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, 1998.
3. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approx-imability - towards tight results. SIAM J. Comput., 27(3):804-915, 1998.
4. M. Bellare and M. Sudan. Improved non-approximability results. In Proc. 26th STOC, pages 184-193, 1994.
5. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci., 47(3):549-595, 1993.
6. I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered PCP and the hardness of hypergraph vertex cover. In Proc. 35th STOC, pages 595-601, 2003.
7. L. Engebretsen. The nonapproximability of non-Boolean predicates. SIAM J. Disc. Math., 18(1):114-129, 2004.
8. L. Engebretsen and J. Holmerin. Three-query PCPs with perfect completeness over non-Boolean domains. In Proc. 18th CCC, pages 284-299, 2003.
9. L. Engebretsen and J. Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Technical Report TRITA-NA-0409, Royal Institute of Technology, April 2004.
10. U. Feige. A threshold of In n for approximating set cover. J. ACM, 45(4):634-652, 1998.
11. G. Hast. Approximating MAX keCSP using random restrictions. In K. Jansen, S. Khanna, J. D. P. Rolim, and D. Ron, editors, Proc. 7th APPROX, 2004, volume 3122 of Lecture Notes in Computer Science, pages 151-162.
12. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
13. J. Håstad and S. Khot. Query efficient PCPs with perfect completeness. In Proc. 42nd FOCS, pages 610-619, 2001.
14. J. Håstad and A. Wigderson. Simple analysis of graph tests for linearity and PCP. Random Struct, and Alg., 22(2): 139-160, 2003.
15. R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998.
16. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd STOC, pages 191-199, 2000.
17. M. Sudan and L. Trevisan. Probabilistically checkable proofs with low amortized query complexity. In Proc. 39th FOCS, pages 18-27, 1998.
18. L. Trevisan. Recycling queries in PCPs and in linearity tests. In Proc. 30th STOC, pages 299-308, 1998.