Hardness results for coloring 3-colorable 3-uniform hypergraphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 23-32

  Khot, Subhash ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FOURIER TRANSFORMS; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

APPROXIMATE COLORING PROBLEM; COLORABLE GRAPHS; HYPERGRAPH; PROBABILISTICALLY CHECKABLE PROOF SYSTEM;

GRAPH THEORY;

EID: 0036957886     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

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, O. Goldreich, and M. Sudan. Free bits, pcps and non-approximability. Electronic Colloquium on Computational Complexity, Technical Report TR95-024, 1995.
4. 14) coloring algorithm for 3-colorable graphs. Information Processing Letters, 61: 49-53, 1997.
5. I. Dinur, V. Guruswami, S. Khot and O. Regev. k - 1 - ε hardness for vertex cover in k-uniform hypergraphs. In preparation.
6. I. Dinur, O. Regev and C. Symth. The hardness of 3-uniform hypergraph coloring. Appearing in Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.
7. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634-652, July 1998.
8. V. Guruswami, J. Håstad, and M. Sudan. Hardness of approximate hypergraph coloring. In Proc. of the 41st IEEE Symposium on Foundations of Computer Science, pages 149-158, 2000. (The references are to the journal version of this paper which is in preparation).
9. E. Halperin R. Nathaniel and U. Zwick. Coloring k-colorable graphs using smaller palettes. In Proc. of the 12th Annual Symposium on Discrete Algorithms, 319-326, 2001.
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. J. Holmerin. Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 ε. To appear in Proc. of the 34th Annual ACM Symposium on Theory of Computing, 2002.
13. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In Proc. of the 35th IEEE Symposium on Foundations of Computer Science, 1994.
14. S. Khanna, N. Linial and S. Safra. On the hardness of approximating the chromatic number. In Proc. of the 2nd Israel Symposium on Theory and Computing Systems, ISTCS, 250-260, IEEE Computer Society Press, 1993.
15. S. Khot. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, 2001.
16. S. Khot. Hardness results for approximate hypergraph coloring. To appear in Proc. of the 34th Annual ACM Symposium on Theory of Computing, 2002.
17. S. Khot. On the power of unique 2-prover 1-round games. To appear in Proc. of the 34th Annual ACM Symposium on Theory of Computing, 2002.
18. M. Krivelevich, R. Nathaniel and B. Sudakov. Approximating coloring and maximum independent set in 3-uniform hypergraphs. In Proc. of the 12th Annual Symposium on Discrete Algorithms, 2001.
19. L. Lovász. Coverings and colorings of hypergraphs. In Proc. of 4th Southeastern Conf. on Combinatorics, Graph Theory and Computing, pages 3-12, Utilitas Mathematica Publishing, Winnipeg, 1973.
20. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
21. U. Zwick. Finding almost satisfying assignments. In Proc. of the 30th Annual ACM Symposium on Theory of Computing, pages 551-560, 1998.