Pages that link to "Item:Q527418"
From MaRDI portal
The following pages link to A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418):
Displaying 15 items.
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- A Graphical Theorem of the Alternative for UTVPI Constraints (Q2787434) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Farkas Bounds on Horn Constraint Systems (Q6489318) (← links)
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints (Q6606248) (← links)
- Constrained read-once refutations in UTVPI constraint systems: a parallel perspective (Q6620016) (← links)
