A sieve algorithm for the shortest lattice vector problem
Top Cited Papers
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 601-610
- https://doi.org/10.1145/380752.380857
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the Limits of Nonapproximability of Lattice ProblemsJournal of Computer and System Sciences, 2000
- Noise-tolerant learning, the parity problem, and the statistical query modelPublished by Association for Computing Machinery (ACM) ,2000
- The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Generating hard instances of lattice problems (extended abstract)Published by Association for Computing Machinery (ACM) ,1996
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- An Algorithmic Theory of Numbers, Graphs and ConvexityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982