Pages that link to "Item:Q1885907"
From MaRDI portal
The following pages link to On the complexity of resolution with bounded conjunctions (Q1885907):
Displaying 16 items.
- The depth of resolution proofs (Q647405) (← links)
- Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- A framework for space complexity in algebraic proof systems (Q2796410) (← links)
- Total space in resolution (Q2829448) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution (Q4651510) (← links)
- (Q4708587) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- (Q5482597) (← links)
- (Q5875713) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
