The following pages link to (Q4818823):
Displaying 5 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)
