Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Noise-tolerant learning, the parity problem, and the statistical query model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Applications of a New Transference Theorem to Ajtai's Connection Factor
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
An Improved Worst-Case to Average-Case Connection for Lattice Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We obtain a 2&Ogr;(n/∈) time algorithm to approximate the length of the shortest vector in an n-dimensional lattice to within a factor of n3+∈.