A new PCP outer verifier with applications to homogeneous linear equations and Max-Bisection

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 11-20

  Holmerin, Jonas ^a   Khot, Subhash ^b,c  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Hardness of Approximation; Linear Equations; Max Bisection; PCPs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; LABELING; LINEAR EQUATIONS; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

CONSTRAINT SATISFACTION PROBLEMS; HARDNESS OF APPROXIMATION; MAX-BISECTIONS; PCPS;

COMPUTATIONAL COMPLEXITY;

EID: 4544354754     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007362     Document Type: Conference Paper

References (23)

1. S. Arora. The PCP Theorems. Chapter in a book; manuscript.
2. 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.
3. S. Arora and S. Safra. Probabilistic checking of proofs : A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
4. S. Arora and M. Sudan. Improved low degree testing and its applications. In Proc. 29th ACM Symposium on Theory of Computing, pages 485-495, 1997.
5. I. Dumer, D. Micciancio and M. Suden. Hardness of Approximating the Minimum Distance of a Linear Code. In Proc. 40th IEEE Symposium on Foundations of Computer Science, 1999.
6. U. Feige. Relations between average case complexity and approximation complexity. In Proc. 34th ACM Symposium on Theory of Computing, 2002.
7. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
8. U. Feige. Personal Communication, 2003.
9. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 105-115, 2000.
10. M X. Goemans and D P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM, 42(6):1115-1145, 1995.
11. E. Halperin and U. Zwick. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. In Proc. 7th Conference on Integer Programming an Combinatorial Optimization, pages 202-217, 2001.
12. 1-ε. In Proc. 37th IEEE Symposium on Foundations of Computer Science, pages 627-636, 1996.
13. J. Hastad. Some optimal inapproximability results. In Proc. 29th ACM Symposium on Theory of Computing, pages 1-10, 1997.
14. J. Holmerin and S. Khot. A strong inapproximability result for a generalization of Minimum Bisection. In Proc. 18th IEEE Conference on Computational Complexity, 2003.
15. S. Khot. Hardness of coloring 3-colorable 3-uniforrn hypergraphs. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, 2002.
16. S. Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symposium on Theory of Computing, 2002.
17. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 - ε In Proc. 18th IEEE Conference on Computational Complexity, 2003.
18. C. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. In Proc. 32nd ACM Symposium on the Theory of Computing, 2000.
19. E. Petrank. The hardness of approximation: gap location. Computational Complexity 4: 133-157 (1994)
20. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
21. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proc. 29th ACM Symposium on the Theory of Computing, 1997.
22. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM J. of Computing, 25(2):252-271, 1996.
23. L. Trevisan, G. Sorkin, M. Sudan and D. Williamson. Gadgets, approximation, and linear programming. In Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996.