Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
- 157 Downloads
This paper shows the problem of ﬁnding 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.
AMS Subject Classification (2000):68Q17
Unable to display preview. Download preview PDF.
© János Bolyai Mathematical Society 2003