Improved Inapproximability of Rainbow Coloring
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. New Hardness Results for Graph and Hypergraph Colorings , 2016, CCC.
[2] Elchanan Mossel,et al. Conditional Hardness for Approximate Coloring , 2009, SIAM J. Comput..
[3] David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..
[4] Girish Varma. Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions , 2015, Chic. J. Theor. Comput. Sci..
[5] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[6] J. Matousek,et al. Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry , 2007 .
[7] Günter M. Ziegler,et al. On generalized Kneser hypergraph colorings , 2007, J. Comb. Theory, Ser. A.
[8] Eden Chlamtác,et al. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[9] J. Wojciechowski. SPLITTING NECKLACES AND A GENERALIZATION OF THE BORSUK-ULAM ANTIPODAL THEOREM , 1996 .
[10] Irit Dinur,et al. The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..
[11] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[12] Subhash Khot,et al. Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs , 2014, SODA.
[13] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[14] Venkatesan Guruswami,et al. The Quest for Strong Inapproximability Results with Perfect Completeness , 2021, Electron. Colloquium Comput. Complex..
[15] Venkatesan Guruswami,et al. Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs , 2015, SODA.
[16] Shuli Chen,et al. On the generalized Erd\H{o}s--Kneser conjecture: proofs and reductions , 2017, 1712.03456.
[17] Venkatesan Guruswami,et al. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..
[18] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[19] Karanbir S. Sarkaria,et al. A generalized kneser conjecture , 1990, J. Comb. Theory, Ser. B.
[20] Venkatesan Guruswami,et al. PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[21] Benny Sudakov,et al. Approximating coloring and maximum independent sets in 3-uniform hypergraphs , 2001, SODA '01.
[22] Imre Bárány,et al. A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.
[23] Venkatesan Guruswami,et al. Hardness of Rainbow Coloring Hypergraphs , 2017, FSTTCS.
[24] Colin McDiarmid,et al. A Random Recolouring Method for Graphs and Hypergraphs , 1993, Combinatorics, Probability and Computing.
[25] Gyanit Singh,et al. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.
[26] Sangxia Huang,et al. Improved Hardness of Approximating Chromatic Number , 2013, APPROX-RANDOM.
[27] Subhash Khot,et al. Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors , 2014, Electron. Colloquium Comput. Complex..