A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Worst-Case Complexity of the Optimal LLL Algorithm
[chapter]

2000
*
Lecture Notes in Computer Science
*

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 ½. This case is of interest because the output is then the strongest Lovász-reduced basis. Experiments reported by Lagarias and Odlyzko [LO83] seem to show that the algorithm remain polynomial in average. However no bound better than a naive exponential order one is established for the worstcase complexity of the optimal LLL

doi:10.1007/10719839_35
fatcat:uzqcj2goejeylmnimxabdepdei