NP-hardness of approximately solving linear equations over reals

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 413-419

  Khot, Subhash ^a   Moshkovitz, Dana ^b  

^a NEW YORK UNIVERSITY   (United States)

^b USA   (United States)

Author keywords

hardness of approximation; linear equations; PCP

Indexed keywords

HARDNESS; LINEAR EQUATIONS;

GAUSSIANS; HARDNESS OF APPROXIMATION; NON-TRIVIAL; TESTING PROCEDURE; UNIQUE GAMES CONJECTURE; ZERO ASSIGNMENT;

NP-HARD;

EID: 79959709044     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993692     Document Type: Conference Paper

References (19)

1. S. Arora, B. Barak, and D. Steurer. Subexponential algorithms for unique games and related problems. In Proc. 51st IEEE Symp. on Foundations of Computer Science, 2010.
2. S. Arora, S. A. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. Vishnoi. Unique games on expanding constraint graphs are easy: extended abstract. In Proc. 40th ACM Symp. on Theory of Computing, pages 21-28, 2008.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998. (Pubitemid 128506634)
4. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, 1998. (Pubitemid 128615465)
5. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan. Linearity testing in characteristic two. IEEE Transactions on Information Theory, 42(6):1781-1795, 1996. (Pubitemid 126769177)
6. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proc. 23rd ACM Symp. on Theory of Computing, pages 21-32, 1991.
7. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
8. T. M. Cover and J. Thomas. Elements of Information Theory. Wiley, 1991.
9. V. Guruswami and P. Raghavendra. Hardness of solving sparse overdetermined linear systems: A 3-query PCP over integers. ACM Trans. Comput. Theory, 1(2):1-20, 2009.
10. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
11. J. Holmerin and S. Khot. A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. In Proc. 36th ACM Symp. on Theory of Computing, pages 11-20, 2004.
12. T. Holenstein. Parallel repetition: Simplification and the no-signaling case. Theory of Computing, 5(1):141-172, 2009.
13. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? SIAM Journal on Computing, 37(1):319-357, 2007. (Pubitemid 351321999)
14. S. Khot and D. Moshkovitz. Hardness of approximately solving linear equations over reals. Technical report, ECCC Report TR10-053, 2010.
15. J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. Journal of the ACM, 49(5):616-639, 2002.
16. D. Pollard. A user's guide to measure theoretic probability. Cambridge University Press, 2002.
17. P. Raghavendra. Optimal algorithms and inapproximability results for every csp? In Proc. 40th ACM Symp. on Theory of Computing, pages 245-254, 2008.
18. R. Raz. A parallel repetition theorem. In SIAM Journal on Computing, volume 27, pages 763-803, 1998.
19. U. Zwick. Approximation algorithms for constraint satisfaction problemsinvolving at most three variables per constraint. In Proc. of 9th SODA, pages 201-210, 1998.