Miklós Ajtai, Ravi Kumar, et al.
CCC 2002
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
A note on the set systems used for broadcast encryption
Ravi Kumar, Alexander Russell
SODA 1998
Conference paper
Multi-Structural Databases
Ronald Fagin, R. Guha, et al.
SIGMOD/PODS/ 2005
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics