Skip to main content
Log in

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

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and 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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-003-0019-y

AMS Subject Classification (2000):

Navigation