On the complexity of approximating the independent set problem
Information and Computation
Randomized algorithms
Computational Complexity
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Error propagation in sparse linear systems with peptide-protein incidence matrices
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
| Hi-index | 0.89 |
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NP@?BPP Max-Satisfy cannot be efficiently approximated within an approximation ratio of 1/n^1^-^@?, 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^@a, but 0