Publication:4699287
From MaRDI portal
zbMath0935.03068MaRDI QIDQ4699287
Publication date: 10 November 1999
03F20: Complexity of proofs
Related Items
Randomized feasible interpolation and monotone circuits with a local oracle, Linear gaps between degrees for the polynomial calculus modulo distinct primes, Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution, A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems]