Bounds on Positive Integral Solutions of Linear Diophantine Equations

DOI10.2307/2041711zbMath0291.10014OpenAlexW4254731105MaRDI QIDQ4041633

L. B. Treybig, Itshak Borosh

Publication date: 1976

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

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Related Items (64)

The Complexity of Reversal-Bounded Model-Checking ⋮ An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines ⋮ Minimal solutions of linear diophantine systems : bounds and algorithms ⋮ Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ Context-free commutative grammars with integer counters and resets ⋮ Complexity of modal logics with Presburger constraints ⋮ Complexity of linear relaxations in integer programming ⋮ Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point ⋮ Unnamed Item ⋮ A Bound on Solutions of Linear Integer Equalities and Inequalities ⋮ Pushdown automata with reversal-bounded counters ⋮ Completeness results for conflict-free vector replacement systems ⋮ On selective unboundedness of VASS ⋮ Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension ⋮ When is an automatic set an additive basis? ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ When the Gomory-chvátal closure coincides with the integer hull ⋮ Complexity, convexity and combinations of theories ⋮ Knapsack problems in products of groups ⋮ Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time ⋮ Unnamed Item ⋮ The complexity of the equivalence problem for two characterizations of Presburger sets ⋮ Simulation by Rounds of Letter-to-Letter Transducers ⋮ On the complexity of computational problems associated with simple stochastic games ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ The computability of LQR and LQG control ⋮ The complexity of decision problems for finite-turn multicounter machines ⋮ Unnamed Item ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ On some decision problems for RAM programs ⋮ A polynomial algorithm for solving systems of two linear diophantine equations ⋮ The complexity of Presburger arithmetic with bounded quantifier alternation depth ⋮ A combinatorial algorithm for Horn programs ⋮ The complexity of drawing trees nicely ⋮ Parameterized verification of algorithms for oblivious robots on a ring ⋮ Polynomial time analysis of toroidal periodic graphs ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ Automatic verification of a class of systolic circuits ⋮ Mixed-integer quadratic programming is in NP ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ On the existence of solutions in systems of linear Diophantine equations ⋮ Normal and sinkless Petri nets ⋮ Non-standard approaches to integer programming ⋮ Linear reachability problems and minimal solutions to linear Diophantine equation systems ⋮ Showing the non-existence of solutions in systems of linear Diophantine equations ⋮ The covering and boundedness problems for vector addition systems ⋮ A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic ⋮ On the rational polytopes with Chvátal rank 1 ⋮ Positive semigroups and generalized Frobenius numbers over totally real number fields ⋮ On minimal elements of upward-closed sets ⋮ On Affine Reachability Problems ⋮ A multiparameter analysis of the boundedness problem for vector addition systems ⋮ Analyzing Reachability for Some Petri Nets With Fast Growing Markings ⋮ \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\) ⋮ Real and integer domination in graphs ⋮ Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming ⋮ Taming past LTL and flat counter systems ⋮ A Sharp Bound for Solutions of Linear Diophantine Equations ⋮ A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations ⋮ Modelization of deterministic rational relations ⋮ Small solutions of linear diophantine equations

Cites Work

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

This page was built for publication: Bounds on Positive Integral Solutions of Linear Diophantine Equations