116
click to vote
LATIN
2000
Springer
15 years 6 months ago
2000
Springer
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