Approximating CVP to Within Almost Polynomial Factor is NP-Hard

Irit Dinur, Guy Kindler, Shmuel Safra. Approximating CVP to Within Almost Polynomial Factor is NP-Hard. Electronic Colloquium on Computational Complexity (ECCC), 5(48), 1998. [doi]

Abstract

Abstract is missing.