Approximating Minimum Unsatisfiability of Linear Equations
Piotr Berman, Marek Karpiński · 2001
We consider the following optimization problem: given a system of m linear equations in n variables over a certain field, a feasible solution is any assignment of values to the variables, and the minimized objective function is the number of equations that are not satisfied. For the case