Pages that link to "Item:Q1405735"
From MaRDI portal
The following pages link to Optimality of size-width tradeoffs for resolution (Q1405735):
Displayed 17 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- On Linear Resolution (Q5015599) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Sum of squares bounds for the ordering principle (Q5092489) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)