Pages that link to "Item:Q4598235"

The following pages link to Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness (Q4598235):

Displaying 7 items.

• Understanding cutting planes for QBFs (Q1784953) (← links)
• Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
• (Q3304106) (← links)
• (Q5136303) (← links)
• Towards Uniform Certification in QBF (Q6151563) (← links)