文章基本信息
- 标题：Approximating CVP to Within Almost Polynomial Factor is NP-Hard
- 本地全文：下载
- 作者：Irit Dinur ; Guy Kindler ; Shmuel Safra 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：1998
- 卷号：1998
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：This paper shows finding the closest vector in a lattice to be NP-hard to approximate to within any factor up to 2(logn)1− where =(loglogn)− and is any positive constant 21.
- 关键词：CVP, lattice, NVP, PCP
