On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:09, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing short linearly independent vectors and short bases in a lattice |
scientific article |
Statements
On the complexity of computing short linearly independent vectors and short bases in a lattice (English)
0 references
29 September 2016
0 references
algorithmic geometry of numbers
0 references
lattices
0 references
worst-case complexity
0 references
average-case complexity
0 references
shortest lattice basis
0 references
shortest vector
0 references
closest vector
0 references
hardness of approximations
0 references
