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

• Type: Conference
• Year: 2000
• Where: LATIN
• Authors: Ali Akhavi
• Keywords: Information Management, LATIN 2000, LLL Algorithm, Optimal Lll Algorithm, Strongest Lov´asz­reduced Basis