Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics
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
Conference paper
Self-similarity in the web
Stephen Dill, Ravi Kumar, et al.
VLDB 2001
Conference paper
A sieve algorithm for the shortest lattice vector problem
Miklos Ajtai, R. Kumar, et al.
STOC 2001
Moses Charikar, Jon Kleinberg, et al.
SIAM Journal on Discrete Mathematics