Efficient solution of linear diophantine equations
From MaRDI portal
Publication:1121310
DOI10.1016/S0747-7171(89)80025-2zbMath0674.10011OpenAlexW2016416448MaRDI QIDQ1121310
Albrecht Fortenbacher, Michael Clausen
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80025-2
graph algorithminhomogeneoushomogeneousminimal solutionslinear diophantine equationlabelled digraphPASCAL implementation
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Linear Diophantine equations (11D04)
Related Items
Factorizations of the same length in numerical semigroups, Holonomic functions and their relation to linearly constrained languages, Minimal resolutions of lattice ideals and integer linear programming, Algorithms for solving systems of linear Diophantine equations in integer domains, Bounding the degree of solutions of differential equations, General solution of systems of linear diophantine equations and inequations, An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers, Cycles and communicating classes in membrane systems and molecular dynamics, Linear Diophantine equations in several variables, Computation of delta sets of numerical monoids., Avoiding slack variables in the solving of linear diophantine equations and inequations, About Gordan's algorithm for binary forms, Nominal AC-matching, The category of \(\mathbb{Z}\)-graded manifolds: what happens if you do not stay positive, NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations, A polynomial algorithm for solving systems of two linear diophantine equations, Finite-state automata in information technologies, Standard bases for local rings of branches and their modules of differentials, Algorithms for solution of systems of linear Diophantine equations in residue fields, An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection, Graph unification and matching, Unification theory, Intruder deduction problem for locally stable theories with normal forms and inverses, On the existence of solutions in systems of linear Diophantine equations, Unnamed Item, Combinatorial method for solving systems of linear constraints, Showing the non-existence of solutions in systems of linear Diophantine equations, AC unification through order-sorted AC1 unification, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations., A note on solving linear Diophantine systems by usingL3-reduction algorithm, Analytic classification of plane branches up to multiplicity 4, Unification problem in equational theories, Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Competing for the \(AC\)-unification race
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification in abelian semigroups
- Associative-commutative unification
- An algebraic approach to unification under associativity and commutativity
- An algorithm for a linear Diophantine equation and a problem of Frobenius
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- A Unification Algorithm for Associative-Commutative Functions
- Complete Sets of Reductions for Some Equational Theories
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
