The following pages link to (Q4625702):
Displaying 19 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Building strategies into QBF proofs (Q2031411) (← 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)
- Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- (Q4625702) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (Q5145632) (← 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)
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study (Q6611965) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- QBF merge resolution is powerful but unnatural (Q6635504) (← links)