A fast method for finding the basis of non-negative solutions to a linear diophantine equation
From MaRDI portal
Publication:1907269
DOI10.1006/jsco.1995.1029zbMath0841.11066OpenAlexW2091550507MaRDI QIDQ1907269
Ana Paula Tomás, Miguel Filgueiras
Publication date: 5 March 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1029
Computer solution of Diophantine equations (11Y50) Congruences in many variables (11D79) Linear Diophantine equations (11D04)
Related Items (8)
An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers ⋮ Inside factorial monoids and the Cale monoid of a linear Diophantine equation ⋮ Algorithms for solution of systems of linear Diophantine equations in residue fields ⋮ On the existence of solutions in systems of linear Diophantine equations ⋮ ABS algorithms for Diophantine linear equations and integer LP problems ⋮ Combinatorial method for solving systems of linear constraints ⋮ Showing the non-existence of solutions in systems of linear Diophantine equations ⋮ Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
This page was built for publication: A fast method for finding the basis of non-negative solutions to a linear diophantine equation
