scientific article; zbMATH DE number 2079024
From MaRDI portal
Publication:4474836
zbMath1044.03542MaRDI QIDQ4474836
Publication date: 21 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Expander Construction in VNC1 ⋮ A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games ⋮ A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems] ⋮ Expander construction in \(\mathrm{VNC}^1\) ⋮ A game characterisation of tree-like Q-resolution size ⋮ Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss ⋮ A combinatorial characterization of resolution width ⋮ Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs ⋮ Bounded-depth Frege complexity of Tseitin formulas for all graphs ⋮ Proof complexity of monotone branching programs
This page was built for publication:
