Pages that link to "Item:Q2475405"
From MaRDI portal
The following pages link to A combinatorial characterization of resolution width (Q2475405):
Displayed 5 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)