An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
From MaRDI portal
Publication:1246557
DOI10.1016/0020-0190(78)90078-9zbMath0377.10011OpenAlexW1991466985MaRDI QIDQ1246557
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90078-9
Related Items
A resolution principle for constrained logics, Holonomic functions and their relation to linearly constrained languages, Minimal solutions of linear diophantine systems : bounds and algorithms, Associative-commutative unification, An algebraic approach to unification under associativity and commutativity, History and basic features of the critical-pair/completion procedure, Finding a partial solution to a linear system of equations in positive integers, Efficient solution of linear diophantine equations, Unification properties of commutative theories: A categorical treatment, Avoiding slack variables in the solving of linear diophantine equations and inequations, Complete equational unification based on an extension of the Knuth-Bendix completion procedure, A polynomial algorithm for solving systems of two linear diophantine equations, The unification type of the Pythagorean equation in varieties of nilpotent rings, Generating-function method for tensor products, Intruder deduction problem for locally stable theories with normal forms and inverses, AC-unification race: The system solving approach, implementation and benchmarks, On the existence of solutions in systems of linear Diophantine equations, Solving word equations, Showing the non-existence of solutions in systems of linear Diophantine equations, AC unification through order-sorted AC1 unification, Unification in commutative theories, Adventures in associative-commutative unification, Complete sets of unifiers and matchers in equational theories, Inverse morphic equivalence on languages, Competing for the \(AC\)-unification race
Cites Work
