Pages that link to "Item:Q5387867"
From MaRDI portal
The following pages link to Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning (Q5387867):
Displaying 8 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- On Linear Resolution (Q5015599) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)