Pages that link to "Item:Q4181607"

The following pages link to A Bound on Solutions of Linear Integer Equalities and Inequalities (Q4181607):

Displaying 40 items.

• Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
• Mixed-integer quadratic programming is in NP (Q517303) (← links)
• The complexity of almost linear diophantine problems (Q753494) (← links)
• A polynomial algorithm for solving systems of two linear diophantine equations (Q914391) (← links)
• Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
• Small solutions of linear diophantine equations (Q1074620) (← links)
• The complexity of the word problem for abelian l-groups (Q1095897) (← links)
• Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
• Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
• Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
• The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
• Normal and sinkless Petri nets (Q1208921) (← links)
• Modelization of deterministic rational relations (Q1603699) (← links)
• Pisot unit generators in number fields (Q1635275) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• NP satisfiability for arrays as powers (Q2152659) (← links)
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
• Emptiness problems for integer circuits (Q2182324) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Verification of parametric concurrent systems with prioritised FIFO resource management (Q2481584) (← links)
• Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
• The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
• Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. (Q2628315) (← links)
• A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction (Q2668897) (← links)
• Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\) (Q2857359) (← links)
• Complexity of Subcases of Presburger Arithmetic (Q3340842) (← links)
• On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
• Variable metric relaxation methods, part II: The ellipsoid method (Q3683896) (← links)
• On box totally dual integral polyhedra (Q3717741) (← links)
• Sensitivity theorems in integer linear programming (Q3793940) (← links)
• A Sharp Bound for Solutions of Linear Diophantine Equations (Q3825192) (← links)
• (Q5016357) (← links)
• Minimal solutions of linear diophantine systems : bounds and algorithms (Q5055757) (← links)
• On Affine Reachability Problems (Q5089216) (← links)
• Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming (Q5853719) (← links)
• Solving word equations (Q5899816) (← links)
• The computational complexity of knot genus in a fixed 3‐manifold (Q6075064) (← links)
• On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)
• The complexity of soundness in workflow nets (Q6649450) (← links)
• Positive existential Definability with unit, addition and coprimeness (Q6666557) (← links)