Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm

Simple item page
dc.creatorvan der Kallen, Wilberd
dc.date1998-12-22
dc.date.accessioned2026-07-07T06:29:57Z
dc.date.available2026-07-07T06:29:57Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/9812130
dc.identifierhttp://arxiv.org/abs/math/9812130
dc.identifierJournal of Symbolic Computation (2000) 30, 329-337
dc.identifierdoi:10.1006/jsco.2000.0374
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/98222
dc.subjectNumber Theory
dc.subject11Y16
dc.titleComplexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm
dc.typetext

Files

Collections

arXiv