Title of article
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Author/Authors
O. Goldreich، نويسنده , , D. Micciancio، نويسنده , , S. Safra، نويسنده , , J. -P. Seifert، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
7
From page
55
To page
61
Keywords
computational complexity , Computational problems in integer lattices , Reducibility among approximation problems , Theory of computation , Linearerror-correcting codes
Journal title
Information Processing Letters
Serial Year
1999
Journal title
Information Processing Letters
Record number
129109
Link To Document