Abstract
A classic result due to Håstad established that for every constant ε > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends on exactly 3 variables and at least a fraction (1 − ε) of the equations can be satisfied, it is NP-hard to satisfy even a fraction (1/q + ε) of the equations.
In this work, we prove the analog of Håstad’s result for equations over the integers (as well as the reals). Formally, we prove that for every ε, δ > 0, given a system of linear equations with integer coefficients where each equation is on 3 variables, it is NP-hard to distinguish between the following two cases: (i) there is an assignment of integer values to the variables that satisfies at least a fraction (1 − ε) of the equations, and (ii) no assignment even of real values to the variables satisfies more than a fraction δ of the equations.
- Amaldi, E. and Kann, V. 1998. On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theor. Comput. Sci. 109, 237--260. Google Scholar
Digital Library
- Arora, S., Babai, L., Stern, J., and Sweedyk, Z. 1997. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54, 2, 317--331. Google Scholar
Digital Library
- Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. 1998. Proof verification and hardness of approximation problems. J. ACM 45, 3, 501--555. Google Scholar
Digital Library
- Bellare, M., Goldreich, O., and Sudan, M. 1998. Free bits, PCP and nonapproximability - towards tight results. SIAM J. Comput. 27, 3, 804--915. Google Scholar
Digital Library
- Ben-Sasson, E., Sudan, M., Vadhan, S. P., and Wigderson, A. 2003. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 612--621. Google Scholar
Digital Library
- Blum, M., Luby, M., and Rubinfeld, R. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 3, 549--595. Google Scholar
Digital Library
- Feige, U. and Reichman, D. 2006. On the hardness of approximating Max-Satisfy. Inform. Process. Lett. 97, 1, 31--35. Google Scholar
Digital Library
- Feldman, V., Gopalan, P., Khot, S., and Ponnuswami, A. K. 2006. New results for learning noisy parities and halfspaces. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. 563--572. Google Scholar
Digital Library
- Guruswami, V. and Raghavendra, P. 2006. Hardness of learning halfspaces with noise. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. 543--552. Google Scholar
Digital Library
- Halldorsson, M. 2000. Approximations of weighted indpendent set and hereditary subset problems. J. Gaph Algor. Appl. 4, 1.Google Scholar
Cross Ref
- Håstad, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. Google Scholar
Digital Library
- Khot, S. 2005. Inapproximability results via long-code-based PCPs. SIGACT News 36, 2. Google Scholar
Digital Library
- Raz, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763--803. Google Scholar
Digital Library
Index Terms
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers
Recommendations
A 3-query PCP over integers
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computingA classic result due to Haastad~hastad established that for every constant ε > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends on exactly 3 variables and at least a fraction (1-ε) of the equations ...
On the Power of Unique 2-Prover 1-Round Games
CCC '02: Proceedings of the 17th IEEE Annual Conference on Computational ComplexityA 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa (we implicitly assume games to be one round games). The value of a 2-prover game is the maximum acceptance probability of the ...
Interactive proofs and the hardness of approximating cliques
The contribution of this paper is two-fold. First, a connection is established between approximating the size of the largest clique in a graph and multi-prover interactive proofs. Second, an efficient multi-prover interactive proof for NP languages is ...






Comments