Pages that link to "Item:Q2118289"
From MaRDI portal
The following pages link to Hardness and optimality in QBF proof systems modulo NP (Q2118289):
Displaying 8 items.
- QBF Resolution Systems and Their Proof Complexities (Q3192061) (← links)
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness (Q4598235) (← links)
- (Q5092469) (← links)
- (Q5136303) (← links)
- Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (Q5145632) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- QBF merge resolution is powerful but unnatural (Q6635504) (← links)