Pages that link to "Item:Q777309"
From MaRDI portal
The following pages link to Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309):
Displaying 7 items.
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← 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)
- A Graphical Theorem of the Alternative for UTVPI Constraints (Q2787434) (← links)