Subhash A. Khot
ABSTRACT
We prove that for an arbitrarily small constant ε>0, assuming NP⊈ DTIME (2logO 1-ε n), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2log1-ε n. This improves upon the previous hardness factor of (log n)δ for some δ>0 due to [AKKV05].
Supplemental Material
- S. Arora, L. Babai, J. Stern, and Z. Sweedyk. Hardness of approximate optima in lattices, co des, and linear systems. Journal of Computer and System Sciences, 54(2):317--331, 1997. Google Scholar
Digital Library
- Mikhail Alekhnovich, Subhash Khot, Guy Kindler, and Nisheeth K. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. In FOCS, pages 216--225. IEEE Computer Society, 2005. Google ScholarDigital Library
- Mikhail Alekhnovich, Subhash Khot, Guy Kindler, and Nisheeth K. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. Computational Complexity, 20(4):741--753, 2011. Google ScholarDigital Library
- 8}ALMSS98Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501--555, 1998. Google ScholarDigital Library
- Dorit Aharonov and Oded Regev. Lattice problems in NP $\cap$ co-NP. J. ACM, 52:749--765, September 2005. Google ScholarDigital Library
- Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of np. J. ACM, 45(1):70--122, 1998. Google ScholarDigital Library
- Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365--426, 2003.Google ScholarCross Ref
- Irit Dinur, Guy Kindler, Ran Raz, and Shmuel Safra. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica, 23(2):205--243, 2003. Google ScholarDigital Library
- V. Feldman, V. Guruswami, P. Raghavendra, and Y. Wu. Agnostic learning of monomials by halfspaces is hard. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, October 2009. Google ScholarDigital Library
- U. Feige and D. Micciancio. The inapproximability of lattice and coding problems with preprocessing. Journal of Computer and System Sciences, 69(1):45--67, 2004. Google ScholarDigital Library
- Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, and Yi Wu. Bypassing UGC from some optimal geometric inapproximability results. Electronic Colloquium on Computational Complexity (ECCC), 17:177, 2010.Google Scholar
- S. Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. In 43$^rd$ IEEE FOCS, pages 23--32, 2002. Google ScholarDigital Library
- Subhash Khot and Ashok Kumar Ponnuswami. Better inapproximability results for maxclique, chromatic number and min-3lin-deletion. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener, editors, ICALP (1), volume 4051 of Lecture Notes in Computer Science, pages 226--237. Springer, 2006. Google ScholarDigital Library
- Subhash Khot and Rishi Saket. On the hardness of learning intersections of two halfspaces. J. Comput. Syst. Sci., 77(1):129--141, 2011. Google ScholarDigital Library
- Carsten Lund, Lance Fortnow, Howard J. Karloff, and Noam Nisan. Algebraic methods for interactive proof systems. J. ACM, 39(4):859--868, 1992. Google ScholarDigital Library
- J.C. Lagarias, H.W. Lenstra, and C.P. Schnorr. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10:333--348, 1990.Google ScholarCross Ref
- Daniele Micciancio and Panagiotis Voulgaris. A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In STOC, pages 351--358, 2010. Google ScholarDigital Library
- Ran Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763--803, 1998. Google ScholarDigital Library
- Oded Regev. Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transactions on Information Theory, 50(9):2031--2037, 2004. Google ScholarDigital Library
- Oded Regev and Ricky Rosen. Lattice problems and norm embeddings. In STOC, pages 447--456, 2006. Google ScholarDigital Library
- Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In STOC, pages 475--484, 1997. Google ScholarDigital Library
- Claus-Peter Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci., 53:201--224, 1987. Google ScholarDigital Library
Index Terms
- 2log1-ε n hardness for the closest vector problem with preprocessing
Recommendations
Conditional hardness for satisfiable 3-CSPs
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingIn this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP ⊆ naPCP1,s[O(log n),3]? In the language of hardness of approximation, this problem is equivalent to determining the ...
On the hardness of approximating label-cover
The LABEL-COVER problem, defined by S. Arora, L. Babai, J. Stem, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733], serves as a starting point for numerous hardness of approximation reductions. It is ...
The inapproximability of lattice and coding problems with preprocessing
Special issue on computational complexity 2002We prove that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate within any factor less than √5/3. More specifically, we show that there exists a reduction from an NP-hard problem to the approximate closest vector problem ...
Comments