MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors
by Oded Goldreich Daniele, Daniele Micciancio, Jean-pierre Seifert — 1999
…Approximating shortest lattice vectors is not harder than approximating closest lattice vectors…
Add To MetaCart

Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors
by O. Goldreich, D. Micciancio, S. Safra, J. -p. Seifert
…Approximating shortest lattice vectors is not harder than approximating closest lattice vectors O…
Cited by 29 (7 self) – Add To MetaCart

complex variable, International Series in Pure and Applied Mathematics.
by unknown authors
…, and J.-P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB