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 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. 
54 Citations
Approximating-CVP to within almost-polynomial factors is NP-hard
  • I. Dinur, Guy Kindler, S. Safra
  • Computer Science
  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
  • 185
  • PDF
Hardness of approximating the Shortest Vector Problem in high lp norms
  • Subhash Khot
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2006
  • 27
Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm
  • Wenbin Chen, J. Meng
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2006
Improved Inapproximability of Lattice and Coding Problems With Preprocessing
  • O. Regev
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 2004
  • 27
Maximum Distance Sub-Lattice Problem
  • PDF
The inapproximability of lattice and coding problems with preprocessing
  • 33
On the Closest Vector Problem with a Distance Guarantee
  • 36
  • PDF
...
1
2
3
4
5
...