Skip to main content
Research
ACM-SIAM 2001
Conference paper

On polynomial approximation to the shortest lattice vector length

Abstract

We obtain a 2 &Ogr;(□) time algorithm to approximate the length of the shortest vector in an ndimensional lattice to within a factor of n 3+□. Copyright © 2009 ACM, Inc.

Related

View all publications