Improved NP-Inapproximability for 2-Variable Linear Equations

An instance of the 2-Lin(2) problem is a system of equations of the form “xi + xj = b (mod 2)”. Given such a system in which it’s possible to satisfy all but an fraction of the equations, we show it is NP-hard to satisfy all but a C fraction of equations, for any C < 11 8 =

• Type: Journal
• Year: 2015
• Where: APPROX
• Authors: Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright
• Keywords: Algorithms, APPROX 2015