Bounds on Positive Integral Solutions of Linear Diophantine Equations

Cites Work

Title not available (Why is that?)
Two-person nonzero-sum games and quadratic programming
Title not available (Why is that?)
Ein Verfahren zur Aufspaltung einer 3-Mannigfaltigkeit in irreduzible 3- Mannigfaltigkeiten
Bounds in Piecewise Linear Topology

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
Exact augmented Lagrangian duality for mixed integer quadratic programming
Linear reachability problems and minimal solutions to linear Diophantine equation systems
On Affine Reachability Problems
Pushdown automata with reversal-bounded counters
Complexity, convexity and combinations of theories
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
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Context-free commutative grammars with integer counters and resets
Modelization of deterministic rational relations
Knapsack problems in products of groups
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
A combinatorial algorithm for Horn programs
Complexity of modal logics with Presburger constraints
A Sharp Bound for Solutions of Linear Diophantine Equations
When the Gomory-chvátal closure coincides with the integer hull
Showing the non-existence of solutions in systems of linear Diophantine equations
A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
On minimal elements of upward-closed sets
On some decision problems for RAM programs
The covering and boundedness problems for vector addition systems
When is an automatic set an additive basis?
Title not available (Why is that?)
A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations
The complexity of the equivalence problem for two characterizations of Presburger sets
\(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
Normal and sinkless Petri nets
A polynomial algorithm for solving systems of two linear diophantine equations
Real and integer domination in graphs
The complexity of Presburger arithmetic with bounded quantifier alternation depth
Automatic verification of a class of systolic circuits
Problems concerning fairness and temporal logic for conflict-free Petri nets
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
Taming past LTL and flat counter systems
A short certificate of the number of universal optimal strategies for stopping simple stochastic games
Minimal solutions of linear diophantine systems : bounds and algorithms
The complexity of decision problems for finite-turn multicounter machines
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
Two variable logic with ultimately periodic counting
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
Polynomial time analysis of toroidal periodic graphs
Reasoning about reversal-bounded counter machines
Simulation by Rounds of Letter-to-Letter Transducers
General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
On the complexity of computational problems associated with simple stochastic games
INTERLEAVING LOGIC AND COUNTING
The computability of LQR and LQG control
On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
Positive existential Definability with unit, addition and coprimeness

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)