The shortest vector in a lattice is hard to approximate to within some constant (Q2719121)
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: The shortest vector in a lattice is hard to approximate to within some constant |
scientific article; zbMATH DE number 1608785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest vector in a lattice is hard to approximate to within some constant |
scientific article; zbMATH DE number 1608785 |
Statements
21 June 2001
0 references
NP-hardness
0 references
shortest vector problem
0 references
point lattices
0 references
geometry of numbers
0 references
sphere packing
0 references
The shortest vector in a lattice is hard to approximate to within some constant (English)
0 references
