Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors |
scientific article; zbMATH DE number 1771694
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating shortest lattice vectors is not harder than approximating closest lattice vectors |
scientific article; zbMATH DE number 1771694 |
Statements
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (English)
0 references
25 July 2002
0 references
oracle
0 references
