Hardness of solving sparse overdetermined linear systems: A 3-Query PCP over Integers

ACM Transactions on Computation Theory

Volumn 1, Issue 2, 2009, Pages

  Guruswami, Venkatesan ^a,b   Raghavendra, Prasad ^a,c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b Carnegie Mellon University   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Hardness of approximation; Linearity testing; Probabilistically checkable proofs; Sparse linear equations

Indexed keywords

FINITE FIELDS; HARDNESS OF APPROXIMATION; INTEGER COEFFICIENT; INTEGER VALUES; LINEARITY TESTING; NP-HARD; OVERDETERMINED SYSTEMS; PROBABILISTICALLY CHECKABLE PROOF; REAL VALUES; SPARSE LINEAR EQUATIONS; SYSTEM OF LINEAR EQUATIONS;

COMPUTATIONAL COMPLEXITY; HARDNESS; HARDNESS TESTING; LINEAR EQUATIONS; LINEAR SYSTEMS; LINEARIZATION;

REAL VARIABLES;

EID: 77955640314     PISSN: 19423454     EISSN: 19423462     Source Type: Journal    
DOI: 10.1145/1595391.1595393     Document Type: Article

References (13)

1. 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.
2. 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.
3. 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.
4. BELLARE, M., GOLDREICH, O., AND SUDAN, M. 1998. Free bits, PCP and nonapproximability -towards tight results. SIAM J. Comput. 27, 3, 804-915.
5. 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.
6. BLUM, M., LUBY, M., AND RUBINFELD, R. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 3, 549-595.
7. FEIGE, U. AND REICHMAN, D. 2006. On the hardness of approximating Max-Satisfy. Inform. Process. Lett. 97, 1, 31-35.
8. 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.
9. 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.
10. HALLDORSSON, M. 2000. Approximations of weighted indpendent set and hereditary subset problems. J. Gaph Algor. Appl. 4, 1.
11. HÅSTAD, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798-859.
12. KHOT, S. 2005. Inapproximability results via long-code-based PCPs. SIGACT News 36, 2.
13. RAZ, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763-803.