Copyright © 2005 Elsevier B.V. All rights reserved.
On the hardness of approximating Max-Satisfy
Accepted 29 August 2005.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over . We prove that unless NP
BPP 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 constant that could not be taken to be arbitrarily close to 1.
Keywords: Approximation algorithms; Computational complexity







E-mail Article
Add to my Quick Links

Cited By in Scopus (2)







