Sciweavers

LATIN
2000
Springer

Worst-Case Complexity of the Optimal LLL Algorithm

13 years 9 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Ali Akhavi
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where LATIN
Authors Ali Akhavi
Comments (0)