Pages that link to "Item:Q3137703"
From MaRDI portal
The following pages link to Regular Resolution Versus Unrestricted Resolution (Q3137703):
Displaying 13 items.
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- Davis-Putnam resolution versus unrestricted resolution (Q1353991) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Resolution decision procedures (Q2751377) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- The complexity of resolution refinements (Q5444704) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Regular resolution effectively simulates resolution (Q6551714) (← links)