The following pages link to (Q4699287):
Displaying 4 items.
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
