Pages that link to "Item:Q2819515"
From MaRDI portal
The following pages link to A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515):
Displaying 8 items.
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← 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)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- Incremental satisfiability and implication for UTVPI constraints (Q2899084) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints (Q6606248) (← links)