Analysis of the upper bound on the complexity of LLL algorithm (Q2817576)
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: Analysis of the upper bound on the complexity of LLL algorithm |
scientific article; zbMATH DE number 6621508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the upper bound on the complexity of LLL algorithm |
scientific article; zbMATH DE number 6621508 |
Statements
1 September 2016
0 references
lattice reduction
0 references
LLL algorithm
0 references
complexity analysis
0 references
matrix updating/downdating
0 references
condition number
0 references
determinant
0 references
0.90377116
0 references
0 references
0.8642703
0 references
0.8586285
0 references
0.8542073
0 references
0.8519633
0 references
0 references
Analysis of the upper bound on the complexity of LLL algorithm (English)
0 references
