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

@article{Dinur1998ApproximatingCT,
title={Approximating CVP to Within
Almost-Polynomial Factors is NP-Hard},
author={I. Dinur and Guy Kindler and S. Safra},
journal={Combinatorica},
year={1998},
volume={23},
pages={205-243}
}

This paper shows the problem of ﬁnding 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.