Pages that link to "Item:Q1924995"
From MaRDI portal
The following pages link to Short resolution proofs for a sequence of tricky formulas (Q1924995):
Displayed 13 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← 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)
- Sum of squares bounds for the ordering principle (Q5092489) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
