The following pages link to (Q4818823):
Displaying 9 items.
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- The Complexity of Propositional Proofs (Q4873893) (← links)
- Natural proofs (Q5906823) (← links)
