Pages that link to "Item:Q2445839"
From MaRDI portal
The following pages link to A combinatorial algorithm for Horn programs (Q2445839):
Displaying 13 items.
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Farkas Bounds on Horn Constraint Systems (Q6489318) (← links)
- Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)
- Projection methods for finding the greatest element of the intersection of max-closed convex sets (Q6638853) (← links)
