Pages that link to "Item:Q2444907"
From MaRDI portal
The following pages link to A characterization of tree-like resolution size (Q2444907):
Displaying 17 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Near optimal seperation of tree-like and general resolution (Q558312) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis (Q894453) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
- (Q3304106) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- (Q4993272) (← links)
- (Q5028438) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
