Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
From MaRDI portal
Publication:4228028
DOI10.1080/10586458.1998.10504362zbMath0922.11112OpenAlexW1992950589MaRDI QIDQ4228028
George Havas, Bohdan S. Majewski, Keith R. Matthews
Publication date: 23 August 1999
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1048515660
Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Matrices, determinants in number theory (11C20)
Related Items (13)
A fixed point iterative approach to integer programming and its distributed computation ⋮ Scaling invariants and symmetry reduction of dynamical systems ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Chiral matter multiplicities and resolution-independent structure in 4D F-theory models ⋮ a-tint: a polymake extension for algorithmic tropical intersection theory ⋮ Jug measuring: algorithms and complexity ⋮ Normal forms for general polynomial matrices ⋮ Storage efficient algorithm for Hermite normal form using LLL ⋮ Reduction of Smith normal form transformation matrices ⋮ Linearizing torsion classes in the Picard group of algebraic curves over finite fields ⋮ Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm ⋮ On the computation of elementary divisors of integer matrices ⋮ Totally tight Chvatal-Gomory cuts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Rosser's generalization of the Euclid algorithm
- The Linear Diophantine Equation
- Algorithm and bound for the greatest common divisor of n integers
- A New Version of the Euclidean Algorith
- A Note on the Linear Diophantine Equation
This page was built for publication: Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
