Pages that link to "Item:Q2049975"
From MaRDI portal
The following pages link to On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975):
Displaying 3 items.
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)