Avoiding slack variables in the solving of linear diophantine equations and inequations
- 20 February 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 173 (1) , 183-208
- https://doi.org/10.1016/s0304-3975(96)00195-8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine EquationsInformation and Computation, 1994
- Constraint satisfaction using constraint logic programmingArtificial Intelligence, 1992
- A polynomial algorithm for solving systems of two linear diophantine equationsTheoretical Computer Science, 1990
- Efficient solution of linear diophantine equationsJournal of Symbolic Computation, 1989
- Constraint satisfaction problems in logic programmingACM SIGART Bulletin, 1988
- Unification in Abelian semigroupsJournal of Automated Reasoning, 1987
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980
- An algorithm to generate the basis of solutions to homogeneous linear diophantine equationsInformation Processing Letters, 1978