Pages that link to "Item:Q1121310"

The following pages link to Efficient solution of linear diophantine equations (Q1121310):

Displaying 33 items.

• Finite-state automata in information technologies (Q464949) (← links)
• Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
• On the existence of solutions in systems of linear Diophantine equations (Q692309) (← links)
• Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
• Computation of delta sets of numerical monoids. (Q889031) (← links)
• A polynomial algorithm for solving systems of two linear diophantine equations (Q914391) (← links)
• Analytic classification of plane branches up to multiplicity 4 (Q1015159) (← links)
• Unification problem in equational theories (Q1280985) (← links)
• Competing for the \(AC\)-unification race (Q1319390) (← links)
• Avoiding slack variables in the solving of linear diophantine equations and inequations (Q1391934) (← links)
• Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers (Q1570259) (← links)
• Bounding the degree of solutions of differential equations (Q1635269) (← links)
• About Gordan's algorithm for binary forms (Q1692130) (← links)
• NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations (Q1709490) (← links)
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\) (Q1827486) (← links)
• Minimal resolutions of lattice ideals and integer linear programming (Q1884028) (← links)
• Combinatorial method for solving systems of linear constraints (Q2263302) (← links)
• Showing the non-existence of solutions in systems of linear Diophantine equations (Q2271591) (← links)
• Algorithms for solving systems of linear Diophantine equations in integer domains (Q2371668) (← links)
• Standard bases for local rings of branches and their modules of differentials (Q2457416) (← links)
• Algorithms for solution of systems of linear Diophantine equations in residue fields (Q2458039) (← links)
• An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection (Q2469234) (← links)
• Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations. (Q2506358) (← links)
• An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers (Q2654969) (← links)
• Linear Diophantine equations in several variables (Q2668066) (← links)
• A note on solving linear Diophantine systems by using<i>L</i>³-reduction algorithm (Q3630442) (← links)
• Graph unification and matching (Q4645268) (← links)
• Factorizations of the same length in numerical semigroups (Q5031763) (← links)
• AC unification through order-sorted AC1 unification (Q5055752) (← links)
• General solution of systems of linear diophantine equations and inequations (Q5055841) (← links)
• (Q5071135) (← links)
• Holonomic functions and their relation to linearly constrained languages (Q5286061) (← links)
• The category of \(\mathbb{Z}\)-graded manifolds: what happens if you do not stay positive (Q6192134) (← links)