Improved NP-Inapproximability for 2-Variable Linear Equations

An instance of the 2-Lin(2) problem is a system of equations of the form "x(i)+x(j)= b (mod 2)." Given such a system in which it is possible to satisfy all but an epsilon fraction of the equations, ...

[1]  Uriel Feige,et al.  On Systems of Linear Equations with Two Variables per Equation , 2004, APPROX-RANDOM.

[2]  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).

[3]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[4]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[5]  Moses Charikar,et al.  Near-optimal algorithms for unique games , 2006, STOC '06.

[6]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[7]  Johan Håstad,et al.  On the Usefulness of Predicates , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[8]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[9]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[10]  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.

[11]  Siu On Chan,et al.  Approximation resistance from pairwise independent subgroups , 2013, STOC '13.

[12]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[13]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[14]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[15]  Anup Rao,et al.  Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..

[16]  Anupam Gupta,et al.  Sparsest cut on bounded treewidth graphs: algorithms and hardness results , 2013, STOC '13.

[17]  David P. Williamson,et al.  Approximation Algorithm for MAX-CUT , 2007 .

[18]  Miroslav Chlebík,et al.  On Approximation Hardness of the Minimum 2SAT-DELETION Problem , 2004, MFCS.

[19]  Sanjeev Arora,et al.  Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[20]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[21]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[22]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[23]  Rae Baxter,et al.  Acknowledgments.-The authors would like to , 1982 .

[24]  Ran Raz,et al.  Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Noga Alon,et al.  Almost k-wise independence versus k-wise independence , 2003, Information Processing Letters.

[26]  Ryan O'Donnell,et al.  Improved NP-Inapproximability for 2-Variable Linear Equations , 2015, APPROX-RANDOM.

[27]  Ryan O'Donnell,et al.  A new point of NP-hardness for unique games , 2012, STOC '12.

[28]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.