on polynomial approximation to the shortest lattice vector length
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 n 3+? .
polynomial approximation lattice vectorization timing algorithm factor