Minimal solutions of linear diophantine systems : bounds and algorithms
From MaRDI portal
Publication:5055757
DOI10.1007/3-540-53904-2_94zbMath1503.11152OpenAlexW1524248088MaRDI QIDQ5055757
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53904-2_94
Analysis of algorithms and problem complexity (68Q25) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16)
Related Items
A study of a family of monomial ideals, Computing generating sets of lattice ideals and Markov bases of lattices, CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems, General solution of systems of linear diophantine equations and inequations, Linear equations for unordered data vectors in $[D^k\to{}Z^d$], Unnamed Item, Affine convex body semigroups., Avoiding slack variables in the solving of linear diophantine equations and inequations, GRIN: An implementation of Gröbner bases for integer programming, Synchronization of Parikh automata, Verifying chemical reaction network implementations: a bisimulation approach, Unboundedness problems for machines with reversal-bounded counters, Lower bounds on the state complexity of population protocols, Unnamed Item, Knapsack in graph groups, Unnamed Item, AC-unification race: The system solving approach, implementation and benchmarks, The regularity of a toric variety, Linear reachability problems and minimal solutions to linear Diophantine equation systems, Combinatorial method for solving systems of linear constraints, On computing Hilbert bases via the Elliot--MacMahon algorithm, MUNCH - Automated Reasoner for Sets and Multisets, Showing the non-existence of solutions in systems of linear Diophantine equations, Unnamed Item, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations., 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\), Efficient automated reasoning about sets and multisets with cardinality constraints
Cites Work
- Total dual integrality and integer polyhedra
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Bounds in Piecewise Linear Topology
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- Combinatorics and commutative algebra
- Unnamed Item
- Unnamed Item
