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

DOI10.1080/00207160701716501MaRDI QIDQ3630442zbMATH OpenOpenAlexFDO

Authors M. 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

\(L^3\)-reduction algorithmEuclidean algorithmlattice basis reduction algorithmslinear Diophantine equationssystems of linear Diophantine equations

Mathematics Subject Classification ID

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

Recommendations

• \(\mathcal{L}\)-algorithm for approximation of Diophantine systems of linear forms
• Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
• scientific article; zbMATH DE number 1090094
• On the solution of a system of linear Diophantine equations
• Algorithms for solving systems of linear Diophantine equations in integer domains
• scientific article; zbMATH DE number 176134
• Algorithms for solving systems of linear Diophantine equations in residue rings
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Algorithms for solution of systems of linear Diophantine equations in residue fields

Cites work

• A class of ABS algorithms for Diophantine linear systems
• A Note on the Linear Diophantine Equation
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Efficient solution of linear diophantine equations
• Factoring polynomials with rational coefficients
• How can we solve a linear Diophantine equation by the basis reduction algorithm
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Part I-Smith form and common divisor of polynomial matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• The Computing Time of the Euclidean Algorithm
• The number of steps in the Euclidean algorithm

Cited in

(3)

• On solving linear Diophantine systems using generalized Rosser's algorithm
• Numerical experiments with the LLL-based Hermite normal form algorithm for solving linear Diophantine systems
• How can we solve a linear Diophantine equation by the basis reduction algorithm

This page was built for publication: A note on solving linear Diophantine systems by usingL³-reduction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630442)