67
Voted
LATIN
2000
Springer
15 years 12 days 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