Pages that link to "Item:Q4041633"
From MaRDI portal
The following pages link to Bounds on Positive Integral Solutions of Linear Diophantine Equations (Q4041633):
Displaying 50 items.
- On selective unboundedness of VASS (Q355513) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- On the existence of solutions in systems of linear Diophantine equations (Q692309) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Knapsack problems in products of groups (Q898247) (← links)
- A polynomial algorithm for solving systems of two linear diophantine equations (Q914391) (← links)
- On minimal elements of upward-closed sets (Q1019726) (← links)
- Small solutions of linear diophantine equations (Q1074620) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Complexity, convexity and combinations of theories (Q1141138) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- On some decision problems for RAM programs (Q1159463) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- Automatic verification of a class of systolic circuits (Q1189257) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- The covering and boundedness problems for vector addition systems (Q1242682) (← links)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
- \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\) (Q1827486) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Parameterized verification of algorithms for oblivious robots on a ring (Q2225474) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Showing the non-existence of solutions in systems of linear Diophantine equations (Q2271591) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Positive semigroups and generalized Frobenius numbers over totally real number fields (Q2299251) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- A Sharp Bound for Solutions of Linear Diophantine Equations (Q3825192) (← links)
- A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations (Q4119255) (← links)
- A Bound on Solutions of Linear Integer Equalities and Inequalities (Q4181607) (← links)
- When is an automatic set an additive basis? (Q4577830) (← links)
- Polynomial time analysis of toroidal periodic graphs (Q4632455) (← links)
