On the hardness of approximating Max-Satisfy

Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy cannot be efficiently approximated within an approximation ratio of 1/n1, if we consider systems of n linear equations with at most n variables and > 0 is an arbitrarily small constant. Previously, it was known that the problem is NP-hard to approximate within a ratio of 1/n , but 0 < < 1 was some specific

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Uriel Feige, Daniel Reichman
• Keywords: Equations, IPL 2006, Linear Equations, Maximum Number