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

Irit Dinur Guy Kindler Ran Raz Shmuel Safra Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. 205-243 2003 23 Combinatorica 2 http://dx.doi.org/10.1007/s00493-003-0019-y db/journals/combinatorica/combinatorica23.html#DinurKRS03