Pages that link to "Item:Q2415363"
From MaRDI portal
The following pages link to A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363):
Displaying 13 items.
- 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)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← 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)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Farkas Bounds on Horn Constraint Systems (Q6489318) (← links)
