文章基本信息
- 标题：The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- 本地全文：下载
- 作者：Daniele Micciancio
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：1998
- 卷号：1998
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We show that computing the approximate length of the shortest vector
in a lattice within a factor c is NP-hard for randomized reductions
for any constant c
- 关键词：hardness of approximation, lattice, shortest vector problem
