Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice VectorsOded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert. ipl, 71(2):55-61, 1999. [doi] The Shortest Vector in a Lattice is Hard to Approximate to Within Some ConstantDaniele Micciancio. focs 1998: 92-98 [doi] The Shortest Vector in a Lattice is Hard to Approximate to within Some ConstantDaniele Micciancio. SICOMP, 30(6):2008-2035, 2000. [doi] The Shortest Vector in a Lattice is Hard to Approximate to within Some ConstantDaniele Micciancio. eccc, 5(16), 1998. [doi]
The following publications are possibly variants of this publication: