Pages that link to "Item:Q1749535"
From MaRDI portal
The following pages link to Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535):
Displaying 11 items.
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← 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)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Farkas Bounds on Horn Constraint Systems (Q6489318) (← links)
