Pages that link to "Item:Q5145632"
From MaRDI portal
The following pages link to Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (Q5145632):
Displaying 16 items.
- Proof complexity of modal resolution (Q832717) (← links)
- QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
- Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- Unified Characterisations of Resolution Hardness Measures (Q3192062) (← links)
- (Q3304106) (← links)
- (Q4625702) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- Term Rewriting and Applications (Q5703845) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Classes of hard formulas for QBF resolution (Q6488807) (← links)