An LLL-reduction algorithm with quasi-linear time complexity (Q5419110): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/1993636.1993691 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2025623851 / rank | |||
Normal rank |
Latest revision as of 03:45, 20 March 2024
scientific article; zbMATH DE number 6301164
Language | Label | Description | Also known as |
---|---|---|---|
English | An LLL-reduction algorithm with quasi-linear time complexity |
scientific article; zbMATH DE number 6301164 |
Statements
An LLL-reduction algorithm with quasi-linear time complexity (English)
0 references
5 June 2014
0 references
LLL lattice basis reduction
0 references
Euclidean lattice
0 references