Algorithms for the Solution of Systems of Linear Diophantine Equations
- 1 November 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (4), 687-708
- https://doi.org/10.1137/0211057
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- The algorithm description language ALDES (report)ACM SIGSAM Bulletin, 1976
- The Computing Time of the Euclidean AlgorithmSIAM Journal on Computing, 1974
- The Exact Solution of Systems of Linear Equations with Polynomial CoefficientsJournal of the ACM, 1973
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- Algorithms for Hermite and Smith normal matrices and linear Diophantine equationsMathematics of Computation, 1971
- Algorithm 288: solution of simultaneous linear Diophantine equations [F4]Communications of the ACM, 1966
- A method of computing exact inverses of matrices with integer coefficientsJournal of Research of the National Bureau of Standards, 1952
- A Note on the Linear Diophantine EquationThe American Mathematical Monthly, 1941