Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Paper
On polynomial-factor approximations to the shortest lattice vector length
Abstract
For every constant ε > 0, we obtain a 2O(n(1/2+1/ε)) time randomized algorithm to approximate the length of the shortest vector in an n-dimensional lattice to within a factor of n3+ε.
Related
Ravi Kumar, Jasmine Novak, et al.
Communications of the ACM
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Tuǧkan Batu, Sanjoy Dasgupta, et al.
SIAM Journal on Computing