On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600)
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 complexity of computing short linearly independent vectors and short bases in a lattice |
scientific article; zbMATH DE number 6631119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing short linearly independent vectors and short bases in a lattice |
scientific article; zbMATH DE number 6631119 |
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
0.8636615872383118
0 references
0.8636612892150879
0 references
0.861925482749939
0 references
0.8507725596427917
0 references
