Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm
Number Theory
2007-05-23 v1
Abstract
We show that the integers in the HMM LLL HNF algorithm have bit length O(m.log(m.B)), where m is the number of rows and B is the maximum square length of a row of the input matrix. This is only a little worse than the estimate O(m.log(B)) in the LLL algorithm.
Cite
@article{arxiv.math/9812130,
title = {Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm},
author = {Wilberd van der Kallen},
journal= {arXiv preprint arXiv:math/9812130},
year = {2007}
}
Comments
10 pages