Some optimal inapproximability results.
We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds...
| Published in: | Journal of the ACM 48, 4 (2001). |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: |