Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors (Q1938739)
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: Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors |
scientific article; zbMATH DE number 6138471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors |
scientific article; zbMATH DE number 6138471 |
Statements
Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors (English)
0 references
22 February 2013
0 references
lattice
0 references
successive minima
0 references
Minkowski reduced bases
0 references
greedy reduction
0 references
0.8555910587310791
0 references
0.8434320092201233
0 references
0.8358916640281677
0 references