How can we solve a linear Diophantine equation by the basis reduction algorithm

DOI10.1080/0020716042000301761zbMath1080.65032OpenAlexW2016712352MaRDI QIDQ5699920

Hamid Esmaeili

Publication date: 27 October 2005

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

Full work available at URL: https://doi.org/10.1080/0020716042000301761

zbMATH Keywords

polynomial time algorithmlinear Diophantine equationunimodular matricesbasis reduction algorithm

Mathematics Subject Classification ID

Related Items (1)

A note on solving linear Diophantine systems by usingL³-reduction algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Fast computation of continued fraction expansions.
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• Euclid's Algorithm for Large Numbers

This page was built for publication: How can we solve a linear Diophantine equation by the basis reduction algorithm