Pages that link to "Item:Q1353991"
From MaRDI portal
The following pages link to Davis-Putnam resolution versus unrestricted resolution (Q1353991):
Displaying 11 items.
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- On resolution with short clauses (Q1380411) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem'' (Q1822244) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- Regular Resolution Versus Unrestricted Resolution (Q3137703) (← links)
- An application of \(P_ 4\)-free graphs in theorem-proving (Q3972130) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- The complexity of resolution refinements (Q5444704) (← links)