Affiliation:
1. Royal Institute of Technology, Stockholm, Sweden
Abstract
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 for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
834 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献