Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors

Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert. Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. Electronic Colloquium on Computational Complexity (ECCC), 6(2), 1999. [doi]

Abstract

Abstract is missing.