An efficient incremental algorithm for solving systems of linear diophantine equations
From MaRDI portal
Publication:1333281
DOI10.1006/inco.1994.1067zbMath0809.11015MaRDI QIDQ1333281
Evelyne Contejean, Hervé Devie
Publication date: 2 April 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ce98f2fa09cf58623ac0cd773c518997077befaa
Related Items
On computing Hilbert bases via the Elliot--MacMahon algorithm, Computing the elasticity of a Krull monoid, Primary ideals of finitely generated commutative cancellative monoids, On the existence of solutions in systems of linear Diophantine equations, Minimal regular 2-graphs and applications, Cycles and communicating classes in membrane systems and molecular dynamics, Verification of bounded Petri nets using integer programming, Algorithms for solving systems of linear Diophantine equations in residue rings, Strongly taut finitely generated monoids., Avoiding slack variables in the solving of linear diophantine equations and inequations, Unification of infinite sets of terms schematized by primal grammars, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Minimal resolutions of lattice ideals and integer linear programming, Showing the non-existence of solutions in systems of linear Diophantine equations, Algorithms for solving systems of linear Diophantine equations in integer domains, Standard bases for local rings of branches and their modules of differentials, Effective solution of linear Diophantine equation systems with an application in chemistry, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations., FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE, Numerical Semigroups with a Monotonic Apery Set, A note on solving linear Diophantine systems by usingL3-reduction algorithm
