skip to main content
research-article

Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups

Published:11 May 2015Publication History
Skip Abstract Section

Abstract

In 1997, Håstad showed NP-hardness of (1 − ϵ, 1/q + δ)-approximating Max-3Lin(Zq); however, it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness of (1 − ϵ, δ)-approximating Max-3Lin(Z). In 2004, Khot--Kindler--Mossel--O’Donnell showed UG-hardness of (1 − ϵ, δ)-approximating Max-2Lin(Zq) for q = q(ϵ, δ) a sufficiently large constant; however, achieving the same hardness for Max-2Lin(Z) was given as an open problem in Raghavendra’s 2009 thesis. In this work, we show that fairly simple modifications to the proofs of the Max-3Lin(Zq) and Max-2Lin(Zq) results yield optimal hardness results over Z. In fact, we show a kind of “bicriteria” hardness: Even when there is a (1 − ϵ)-good solution over Z, it is hard for an algorithm to find a δ-good solution over Z, R, or Zm for any mq(ϵ, δ) of the algorithm’s choosing.

References

  1. Sanjeev Arora, László Babai, Jacques Stern, and Z. Sweedyk. 1993. The hardness of approximate optima in lattices, codes and linear equations. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science. 724--733. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. 1998. Proof verification and the hardness of approximation problems. Journal of the ACM 45, 3, 501--555, May. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Sanjeev Arora and Shmuel Safra. 1998. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45, 1, 70--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Vitaly Feldman, Parikshit Gopalan, Subhash Khot, and Ashok Ponnuswami. 2006. New results for learning noisy parities and halfspaces. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. 349--359. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Venkatesan Guruswami and Prasad Raghavendra. 2006. Hardness of learning halfspaces with noise. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science. 543--552. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Venkatesan Guruswami and Prasad Raghavendra. 2007. A 3-query PCP over integers. In Proceedings of the 39th ACM Symposium on Theory of Computing. 198--206. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM42, 1115--1145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Johan Håstad. 2001. Some optimal inapproximability results. Journal of the ACM 48, 4, 798--859. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Subhash Khot. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing. 767--775. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell. 2007. Optimal inapproximability results for Max-Cut and other 2-variable CSPs? SIAM Journal on Computing 37, 1, 319--357. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Subhash Khot and Dana Moshkovitz. 2013. Np-hardness of approximately solving linear equations over reals. SIAM Journal on Computing 42, 3, 752--791.Google ScholarGoogle ScholarCross RefCross Ref
  12. Elchanan Mossel, Ryan O’Donnell, and Krzysztof Oleszkiewicz. 2005. Noise stability of functions with low influences: invariance and optimality. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. 21--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Ryan O’Donnell. 2007. Analysis of Boolean Functions Lecture Notes, 2007. Retrieved from http://www.cs.cmu.edu/∼odonnell/boolean-analysis/.Google ScholarGoogle Scholar
  14. Prasad Raghavendra. 2009. Approximating NP-hard Problems: Efficient Algorithms and Their Limits. PhD thesis, University of Washington. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Ran Raz. 1998. A parallel repetition theorem. SIAM Journal on Computing 27, 3, 763--803, June. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!