An upper bound on the average number of iterations of the LLL algorithm
Open Access
- 1 January 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 123 (1) , 95-115
- https://doi.org/10.1016/0304-3975(94)90071-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Parallel lattice basis reductionPublished by Association for Computing Machinery (ACM) ,1992
- Gauss' algorithm revisitedJournal of Algorithms, 1991
- Lattice points in high-dimensional spheresMonatshefte für Mathematik, 1990
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, LovászRAIRO - Theoretical Informatics and Applications, 1989
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Über die mittlere Schrittanzahl bei DivisionsalgorithmenMathematische Nachrichten, 1978
- The number of steps in the Euclidean algorithmJournal of Number Theory, 1970