Bounds on Positive Integral Solutions of Linear Diophantine Equations

DOI10.2307/2041711zbMath0291.10014MaRDI QIDQ4041633

L. B. Treybig, Itshak Borosh

Publication date: 1976

Full work available at URL: https://doi.org/10.2307/2041711

Mathematics Subject Classification ID

11D04: Linear Diophantine equations

Related Items

A Bound on Solutions of Linear Integer Equalities and Inequalities, On selective unboundedness of VASS, On the existence of solutions in systems of linear Diophantine equations, Non-standard approaches to integer programming, Linear reachability problems and minimal solutions to linear Diophantine equation systems, A polynomial algorithm for solving systems of two linear diophantine equations, On minimal elements of upward-closed sets, Small solutions of linear diophantine equations, An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Pushdown automata with reversal-bounded counters, Completeness results for conflict-free vector replacement systems, Problems concerning fairness and temporal logic for conflict-free Petri nets, Complexity, convexity and combinations of theories, The complexity of the equivalence problem for two characterizations of Presburger sets, The complexity of decision problems for finite-turn multicounter machines, On some decision problems for RAM programs, The complexity of Presburger arithmetic with bounded quantifier alternation depth, The complexity of drawing trees nicely, A unified approach for deciding the existence of certain petri net paths, Automatic verification of a class of systolic circuits, Normal and sinkless Petri nets, The covering and boundedness problems for vector addition systems, A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic, Real and integer domination in graphs, A short certificate of the number of universal optimal strategies for stopping simple stochastic games, Modelization of deterministic rational relations, A multiparameter analysis of the boundedness problem for vector addition systems, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), Small vertex cover makes Petri net coverability and boundedness easier, Showing the non-existence of solutions in systems of linear Diophantine equations, Complexity of modal logics with Presburger constraints, The Complexity of Reversal-Bounded Model-Checking, A Sharp Bound for Solutions of Linear Diophantine Equations, A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Ein Verfahren zur Aufspaltung einer 3-Mannigfaltigkeit in irreduzible 3- Mannigfaltigkeiten
• Two-person nonzero-sum games and quadratic programming
• Bounds in Piecewise Linear Topology