Pages that link to "Item:Q1610491"
From MaRDI portal
The following pages link to The complexity of read-once resolution (Q1610491):
Displayed 10 items.
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← 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)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)