Hardness of approximating the Shortest Vector Problem in high norms☆
Under an Elsevier user license
open archive
Keywords
Computational complexity
Lattices
Shortest vector problem
Approximation algorithms
Hardness of approximation
Cited by (0)
- ☆
A preliminary version of this paper appeared in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003. This research was supported in part by Sanjeev Arora's NSF Awards 0205594, CCR 0098180 and the David and Lucile Packard Fellowship.
Copyright © 2005 Elsevier Inc. All rights reserved.