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

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.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to I. Dinur.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Dinur, I., Kindler, G., Raz, R. et al. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Combinatorica 23, 205–243 (2003). https://doi.org/10.1007/s00493-003-0019-y

Download citation

AMS Subject Classification (2000):

  • 68Q17