PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring
暂无分享,去创建一个
[1] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[2] Venkatesan Guruswami,et al. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes , 2013, STOC.
[3] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[4] Venkatesan Guruswami,et al. PCPs via the low-degree long code and hardness for constrained hypergraph coloring , 2015 .
[5] Carsten Lund,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[6] Johan Håstad. On the NP-Hardness of Max-Not-2 , 2012, APPROX-RANDOM.
[7] Subhash Khot,et al. Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[8] Ryan O'Donnell,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[9] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[10] Irit Dinur,et al. The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..
[11] Venkatesan Guruswami,et al. Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..
[12] 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..
[13] Irit Dinur,et al. Covering CSPs , 2013, 2013 IEEE Conference on Computational Complexity.
[14] Subhash Khot,et al. Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs , 2014, SODA.
[15] Ran Raz,et al. PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.
[16] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[17] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[18] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[19] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[20] 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.
[21] Rishi Saket. Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[22] Manuel Bodirsky,et al. The Complexity of Equality Constraint Languages , 2006, Theory of Computing Systems.
[23] Subhash Khot. Hardness results for approximate hypergraph coloring , 2002, STOC '02.
[24] Prasad Raghavendra,et al. Making the Long Code Shorter , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[25] Daniel M. Kane,et al. A PRG for lipschitz functions of polynomials with applications to sparsest cut , 2012, STOC '13.