An efficient incremental algorithm for solving systems of linear diophantine equations
From MaRDI portal
By generalization of an algorithm by Fortenbacher [\textit{M. Clausen} and \textit{A. Fortenbacher}, J. Symb. Comput. 8, 201-216 (1989; Zbl 0674.10011)] for solving one linear equation an efficient method for solving a system of linear diophantine equations is given. The paper contains proofs of termination, completeness, and correctness; it contains also comparisons with other algorithms.
Recommendations
Cited in
(57)- On solving linear Diophantine systems using generalized Rosser's algorithm
- Efficient solution of linear diophantine equations
- Sequential and simultaneous aggregation of diophantine equations
- Avoiding slack variables in the solving of linear diophantine equations and inequations
- Unification of infinite sets of terms schematized by primal grammars
- Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
- N-solutions to linear systems over Z
- Minimal resolutions of lattice ideals and integer linear programming
- Showing the non-existence of solutions in systems of linear Diophantine equations
- Sequential composition of linear systems' clans
- A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Algorithms for solving systems of linear Diophantine equations in integer domains
- Verifying chemical reaction network implementations: a bisimulation approach
- 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.
- Linear Diophantine equations in several variables
- FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- scientific article; zbMATH DE number 1684382 (Why is no real title available?)
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- scientific article; zbMATH DE number 4175020 (Why is no real title available?)
- scientific article; zbMATH DE number 3883605 (Why is no real title available?)
- Numerical Semigroups with a Monotonic Apery Set
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- A note on solving linear Diophantine systems by usingL3-reduction algorithm
- scientific article; zbMATH DE number 3900852 (Why is no real title available?)
- scientific article; zbMATH DE number 3968335 (Why is no real title available?)
- scientific article; zbMATH DE number 3985313 (Why is no real title available?)
- scientific article; zbMATH DE number 4101294 (Why is no real title available?)
- scientific article; zbMATH DE number 177666 (Why is no real title available?)
- scientific article; zbMATH DE number 1222422 (Why is no real title available?)
- Graph unification and matching
- scientific article; zbMATH DE number 4115835 (Why is no real title available?)
- Complete intersections in simplicial toric varieties
- Solving rank one perturbed linear diophantine systems using the Hermite normal form
- General solution of systems of linear diophantine equations and inequations
- scientific article; zbMATH DE number 7510495 (Why is no real title available?)
- “Syntactic” AC-unification
- Semigroups with fixed multiplicity and embedding dimension
- Basic bounds of Fréchet classes
- An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach
- Diophantine equations, Presburger arithmetic and finite automata
- Algorithmic Number Theory
- On computing Hilbert bases via the Elliot--MacMahon algorithm
- Computing the elasticity of a Krull monoid
- Primary ideals of finitely generated commutative cancellative monoids
- Algorithms for constructing minimal generating set of solutions for systems of linear equations
- Algorithms for solving linear constraints over the set \(\{0, 1\}\)
- 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
- A polynomial algorithm for solving systems of two linear diophantine equations
- Algorithms for solving systems of linear Diophantine equations in residue rings
- Strongly taut finitely generated monoids.
This page was built for publication: An efficient incremental algorithm for solving systems of linear diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333281)
