Mathematics – Number Theory
Scientific paper
1998-12-22
Journal of Symbolic Computation (2000) 30, 329-337
Mathematics
Number Theory
10 pages
Scientific paper
10.1006/jsco.2000.0374
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.
No associations
LandOfFree
Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-17260