Pages that link to "Item:Q2843321"
From MaRDI portal
The following pages link to An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Q2843321):
Displaying 5 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- On Linear Resolution (Q5015599) (← links)
