Shortest Vector Problem
Author:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 1196-1197
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Hardness of approximating the shortest vector problem in latticesJournal of the ACM, 2005
- Approximating to within almost-polynomial factors is NP-hardTheoretical Computer Science, 2002
- Complexity of Lattice Problems2002
- On the Limits of Nonapproximability of Lattice ProblemsJournal of Computer and System Sciences, 2000
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982