Pages that link to "Item:Q835026"
From MaRDI portal
The following pages link to Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026):
Displaying 6 items.
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)