Advertisement

Combinatorica

, Volume 23, Issue 2, pp 205–243 | Cite as

Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

  • I. Dinur
  • G. Kindler
  • R. Raz
  • S. Safra
Original Paper

This paper shows the problem of finding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor n c/log log n for some constant c > 0.

AMS Subject Classification (2000):

68Q17 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society 2003

Authors and Affiliations

  1. 1.Department of Computer ScienceTel-Aviv UniversityTel-AvivIsrael
  2. 2.Department of Computer ScienceTel-Aviv UniversityTel-AvivIsrael
  3. 3.Faculty of Mathematics and Computer ScienceWeizmann Institute of ScienceRehovotIsrael
  4. 4.Department of Computer ScienceTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations