scientific article; zbMATH DE number 1361469
From MaRDI portal
Publication:4699287
Cited in
(5)- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems
- Polynomially and superexponentially shorter proofs in fragments of arithmetic
- Randomized feasible interpolation and monotone circuits with a local oracle
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699287)
