An efficient incremental algorithm for solving systems of linear diophantine equations
From MaRDI portal
Publication:1333281
DOI10.1006/inco.1994.1067zbMath0809.11015OpenAlexW2011618311MaRDI QIDQ1333281
Hervé Devie, Evelyne Contejean
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
Minimal resolutions of lattice ideals and integer linear programming, Algorithms for solving systems of linear Diophantine equations in integer domains, General solution of systems of linear diophantine equations and inequations, Minimal regular 2-graphs and applications, Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids., Cycles and communicating classes in membrane systems and molecular dynamics, Verification of bounded Petri nets using integer programming, Linear Diophantine equations in several variables, “Syntactic” AC-unification, Avoiding slack variables in the solving of linear diophantine equations and inequations, Unification of infinite sets of terms schematized by primal grammars, Verifying chemical reaction network implementations: a bisimulation approach, Complete intersections in simplicial toric varieties, Standard bases for local rings of branches and their modules of differentials, Algorithms for solving systems of linear Diophantine equations in residue rings, Graph unification and matching, Strongly taut finitely generated monoids., FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE, On the existence of solutions in systems of linear Diophantine equations, Unnamed Item, On computing Hilbert bases via the Elliot--MacMahon algorithm, Showing the non-existence of solutions in systems of linear Diophantine equations, Effective solution of linear Diophantine equation systems with an application in chemistry, Computing the elasticity of a Krull monoid, Primary ideals of finitely generated commutative cancellative monoids, Sequential composition of linear systems' clans, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations., Numerical Semigroups with a Monotonic Apery Set, Semigroups with fixed multiplicity and embedding dimension, A note on solving linear Diophantine systems by usingL3-reduction algorithm, An Overview of the Computational Aspects of Nonunique Factorization Invariants, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Unnamed Item, A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings., Diophantine equations, Presburger arithmetic and finite automata