Pages that link to "Item:Q1702822"
From MaRDI portal
The following pages link to A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822):
Displaying 5 items.
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← 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)
