A note on solving linear Diophantine systems by usingL3-reduction algorithm

DOI10.1080/00207160701716501zbMath1234.11166OpenAlexW2084367930MaRDI QIDQ3630442

Mostafa Khorramizadeh

Publication date: 29 May 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a794849338

zbMATH Keywords

linear Diophantine equationsEuclidean algorithmsystems of linear Diophantine equationslattice basis reduction algorithms\(L^3\)-reduction algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Computer solution of Diophantine equations (11Y50) Counting solutions of Diophantine equations (11D45) Linear Diophantine equations (11D04)

Cites Work

• Unnamed Item
• Efficient solution of linear diophantine equations
• Factoring polynomials with rational coefficients
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• Part I-Smith form and common divisor of polynomial matrices
• The Computing Time of the Euclidean Algorithm
• How can we solve a linear Diophantine equation by the basis reduction algorithm
• A Note on the Linear Diophantine Equation
• The number of steps in the Euclidean algorithm
• A class of ABS algorithms for Diophantine linear systems