Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: symbolic and algebraic computation (2nd ed.)
Automatic translation of FORTRAN programs to vector form
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Efficient solution of linear diophantine equations
Journal of Symbolic Computation
A polynomial algorithm for solving systems of two linear diophantine equations
Theoretical Computer Science
Minimal solutions of linear diophantine systems: bounds and algorithms
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Theoretical Computer Science
Handbook of logic in artificial intelligence and logic programming
A fast method for finding the basis of nonnegative solutions to a linear Diophantine equation
Journal of Symbolic Computation
Avoiding slack variables in the solving of linear diophantine equations and inequations
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Constraints in computational logics: theory and applications
Constraints in computational logics: theory and applications
| Hi-index | 0.00 |
Criteria of compatibility of a system of linear Diophantine equations, strict inequations, and nonstrict inequations are considered. Upper bounds for components of a minimal set of solutions and algorithms of construction of minimal generating sets of solutions for all types of systems are given. These criteria and the corresponding algorithms for constructing a minimal supporting set of solutions can be used in solving all the considered types of systems and systems of mixed types.