Bounds on Positive Integral Solutions of Linear Diophantine Equations

Cites work

scientific article; zbMATH DE number 3121282 (Why is no real title available?)
scientific article; zbMATH DE number 3247276 (Why is no real title available?)
Bounds in Piecewise Linear Topology
Ein Verfahren zur Aufspaltung einer 3-Mannigfaltigkeit in irreduzible 3- Mannigfaltigkeiten
Two-person nonzero-sum games and quadratic programming

Cited in

(66)

A multiparameter analysis of the boundedness problem for vector addition systems
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
Completeness results for conflict-free vector replacement systems
Non-standard approaches to integer programming
On the existence of solutions in systems of linear Diophantine equations
Small solutions of linear diophantine equations
Two variable logic with ultimately periodic counting
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Exact augmented Lagrangian duality for mixed integer quadratic programming
Pushdown automata with reversal-bounded counters
On Affine Reachability Problems
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
Complexity, convexity and combinations of theories
Polynomial time analysis of toroidal periodic graphs
Complexity of linear relaxations in integer programming
The complexity of reversal-bounded model-checking
A Bound on Solutions of Linear Integer Equalities and Inequalities
Affine extensions of integer vector addition systems with states
Modelization of deterministic rational relations
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Context-free commutative grammars with integer counters and resets
Knapsack problems in products of groups
Reasoning about reversal-bounded counter machines
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Simulation by Rounds of Letter-to-Letter Transducers
General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
A combinatorial algorithm for Horn programs
Complexity of modal logics with Presburger constraints
A Sharp Bound for Solutions of Linear Diophantine Equations
A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
When the Gomory-chvátal closure coincides with the integer hull
Showing the non-existence of solutions in systems of linear Diophantine equations
On the complexity of computational problems associated with simple stochastic games
On minimal elements of upward-closed sets
On some decision problems for RAM programs
The covering and boundedness problems for vector addition systems
The complexity of the equivalence problem for two characterizations of Presburger sets
When is an automatic set an additive basis?
N-solutions to linear systems over Z
A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations
Normal and sinkless Petri nets
scientific article; zbMATH DE number 7168147 (Why is no real title available?)
A polynomial algorithm for solving systems of two linear diophantine equations
Real and integer domination in graphs
INTERLEAVING LOGIC AND COUNTING
The complexity of Presburger arithmetic with bounded quantifier alternation depth
Automatic verification of a class of systolic circuits
The computability of LQR and LQG control
Problems concerning fairness and temporal logic for conflict-free Petri nets
On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
On the rational polytopes with Chvátal rank 1
Parameterized verification of algorithms for oblivious robots on a ring
On selective unboundedness of VASS
A short certificate of the number of universal optimal strategies for stopping simple stochastic games
Taming past LTL and flat counter systems
The complexity of decision problems for finite-turn multicounter machines
Minimal solutions of linear diophantine systems : bounds and algorithms
Positive existential Definability with unit, addition and coprimeness
On the complexity of the linear-time μ-calculus for Petri Nets
Polynomial vector addition systems with states
The complexity of drawing trees nicely
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
Mixed-integer quadratic programming is in NP
A unified approach for deciding the existence of certain petri net paths
Positive semigroups and generalized Frobenius numbers over totally real number fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4041633)