Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
暂无分享,去创建一个
Venkatesan Guruswami | Johan Håstad | Srikanth Srinivasan | Girish Varma | Prahladh Harsha | J. Håstad | P. Harsha | V. Guruswami | S. Srinivasan | G. Varma
[1] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[2] Madhu Sudan,et al. Optimal Testing of Multivariate Polynomials over Small Prime Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[3] Elchanan Mossel,et al. Conditional hardness for approximate coloring , 2005, STOC '06.
[4] Subhash Khot,et al. Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Venkatesan Guruswami,et al. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..
[6] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[7] Alan M. Frieze,et al. Coloring Bipartite Hypergraphs , 1996, IPCO.
[8] Ken-ichi Kawarabayashi,et al. Combinatorial Coloring of 3-Colorable Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[9] 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.
[10] Eden Chlamtác. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[11] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[12] Venkatesan Guruswami,et al. PCPs via the low-degree long code and hardness for constrained hypergraph coloring , 2015 .
[13] Benny Sudakov,et al. Approximating coloring and maximum independent sets in 3-uniform hypergraphs , 2001, SODA '01.
[14] Subhash Khot,et al. Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] Rishi Saket. Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[17] Harald Niederreiter,et al. Finite fields: Author Index , 1996 .
[18] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.
[19] Daniel M. Kane,et al. A PRG for lipschitz functions of polynomials with applications to sparsest cut , 2012, STOC '13.
[20] Subhash Khot,et al. Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs , 2014, SODA.
[21] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[22] Girish Varma. Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions , 2015, Chic. J. Theor. Comput. Sci..
[23] Venkatesan Guruswami,et al. Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..
[24] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[25] Venkatesan Guruswami,et al. On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..
[26] Avrim Blum,et al. New approximation algorithms for graph coloring , 1994, JACM.
[27] Irit Dinur,et al. Covering CSPs , 2013, 2013 IEEE Conference on Computational Complexity.
[28] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] Rudolf Lide,et al. Finite fields , 1983 .
[30] Irit Dinur,et al. The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..
[31] Noga Alon,et al. Approximate Hypergraph Coloring , 1996, Nord. J. Comput..
[32] Irit Dinur,et al. The Hardness of 3-Uniform Hypergraph Coloring , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[33] Subhash Khot. Hardness results for approximate hypergraph coloring , 2002, STOC '02.
[34] Sangxia Huang,et al. Improved Hardness of Approximating Chromatic Number , 2013, APPROX-RANDOM.
[35] Sanjeev Arora,et al. New approximation guarantee for chromatic number , 2006, STOC '06.
[36] Prasad Raghavendra,et al. Making the Long Code Shorter , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.