Abstract
This paper shows the problem of finding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor nc/log log n for some constant c>0.
Cite
CITATION STYLE
APA
Dinur, I., Kindler, G., Raz, R., & Safra, S. (2003). Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica, 23(2), 205–243. https://doi.org/10.1007/s00493-003-0019-y
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free