The worst-case behavior of schnorr s algorithm approximating the shortest nonzero vector in a lattice

Miklós Ajtai. The worst-case behavior of schnorr s algorithm approximating the shortest nonzero vector in a lattice. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 396-406, ACM, 2003. [doi]

Abstract

Abstract is missing.