Pages that link to "Item:Q2566064"
From MaRDI portal
The following pages link to Separation results for the size of constant-depth propositional proofs (Q2566064):
Displaying 7 items.
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- On transformations of constant depth propositional proofs (Q2311211) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- On Linear Resolution (Q5015599) (← links)
- On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← links)
