A Bound on Solutions of Linear Integer Equalities and Inequalities

Cites Work

Title not available (Why is that?)
Bounds on Positive Integral Solutions of Linear Diophantine Equations
Komplexität von Entscheidungsproblemen. Ein Seminar
A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations

Cited In (39)

Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\)
Completeness results for conflict-free vector replacement systems
Complexity of Subcases of Presburger Arithmetic
Small solutions of linear diophantine equations
Exact augmented Lagrangian duality for mixed integer quadratic programming
On Affine Reachability Problems
Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
Verification of parametric concurrent systems with prioritised FIFO resource management
Knapsack in graph groups
Pisot unit generators in number fields
Modelization of deterministic rational relations
On Presburger arithmetic extended with non-unary counting quantifiers
The complexity of the word problem for abelian l-groups
A Sharp Bound for Solutions of Linear Diophantine Equations
Variable metric relaxation methods, part II: The ellipsoid method
On the descriptional complexity of operations on semilinear sets
Normal and sinkless Petri nets
Exploiting a hypergraph model for finding Golomb rulers
The complexity of almost linear diophantine problems
Solving word equations
A polynomial algorithm for solving systems of two linear diophantine equations
The computational complexity of knot genus in a fixed 3‐manifold
A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction
The complexity of Presburger arithmetic with bounded quantifier alternation depth
The complexity of soundness in workflow nets
NP satisfiability for arrays as powers
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
Polynomial threshold functions and Boolean threshold circuits
Emptiness problems for integer circuits
Sensitivity theorems in integer linear programming
Minimal solutions of linear diophantine systems : bounds and algorithms
Weak quantifier elimination for the full linear theory of the integers
Positive existential Definability with unit, addition and coprimeness
The existential theory of equations with rational constraints in free groups is PSPACE-complete
A complete and terminating approach to linear integer solving
Subclasses of Presburger arithmetic and the polynomial-time hierarchy
Mixed-integer quadratic programming is in NP
On box totally dual integral polyhedra
Dominoes and the complexity of subclasses of logical theories

This page was built for publication: A Bound on Solutions of Linear Integer Equalities and Inequalities

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