On the unique shortest lattice vector problem (Q5941093)
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: On the unique shortest lattice vector problem |
scientific article; zbMATH DE number 1635258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the unique shortest lattice vector problem |
scientific article; zbMATH DE number 1635258 |
Statements
On the unique shortest lattice vector problem (English)
0 references
20 August 2001
0 references
We show that the problem of deciding whether a given rational lattice \(L\) has a vector of length less than some given value \(r\) is NP-hard, even under the promise that \(L\) has exactly zero or one vector of length less than \(r\).
0 references
integer lattices
0 references
shortest vector problem
0 references
unique solutions
0 references
0 references
0 references
0.90962315
0 references
0 references
0.89932734
0 references
0.8971332
0 references
0.8840147
0 references
0.8788321
0 references
