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
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Funda Ergün, Ravi Kumar, et al.
Information and Computation
Conference paper
Comparing and aggregating rankings with ties
Ronald Fagin, Ravi Kumar, et al.
SIGMOD/PODS/ 2004