Skip to Main content Skip to Navigation
Journal articles

Fast computation of Hermite normal forms of random integer matrices

Clément Pernet 1, * William Stein 2 
* Corresponding author
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This paper is about how to compute the Hermite normal form of a random integer matrix in practice. We propose significant improvements to the algorithm by Micciancio and Warinschi, and extend these techniques to the computation of the saturation of a matrix. We describe the fastest implementation for computing Hermite normal form for large matrices with large entries.
Complete list of metadata
Contributor : Grégory Mounié Connect in order to contact the contributor
Submitted on : Friday, March 8, 2013 - 3:31:46 PM
Last modification on : Wednesday, July 6, 2022 - 4:17:23 AM

Links full text



Clément Pernet, William Stein. Fast computation of Hermite normal forms of random integer matrices. Journal of Number Theory, Elsevier, 2010, 130 (7), pp.1675―1683. ⟨10.1016/j.jnt.2010.01.017⟩. ⟨hal-00798442⟩



Record views