Abstract
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 of the finite field GF[2], this problem is also known as the Nearest Codeword problem. In this note we show that for any constant c there exists a randomized polynomial time algorithm that approximates the above problem, called the Minimum Unsatisfiability of Linear Equations (Min-Unsatisfy for short), with n/(clogn) approximation ratio. Our results hold for any field in which systems of linear equations can be solved in polynomial time.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |
| Publisher | Association for Computing Machinery |
| Pages | 514-516 |
| Number of pages | 3 |
| Volume | 06-08-January-2002 |
| ISBN (Electronic) | 089871513X |
| State | Published - Jan 1 2002 |
| Event | 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 - San Francisco, United States Duration: Jan 6 2002 → Jan 8 2002 |
Other
| Other | 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |
|---|---|
| Country/Territory | United States |
| City | San Francisco |
| Period | 1/6/02 → 1/8/02 |
All Science Journal Classification (ASJC) codes
- Software
- Mathematics(all)