Twelve Problems in Proof Complexity
From MaRDI portal
Publication:3503621
DOI10.1007/978-3-540-79709-8_4zbMath1142.03369OpenAlexW1524684967MaRDI QIDQ3503621
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_4
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of proofs (03F20)
Related Items (6)
Propositional Proofs in Frege and Extended Frege Systems (Abstract) ⋮ Towards NP-P via proof complexity and search ⋮ On the compressibility of finite languages and formal proofs ⋮ An Introduction to Lower Bounds on Resolution Proof Systems ⋮ Compressibility of Finite Languages by Grammars ⋮ On the cover complexity of finite languages
This page was built for publication: Twelve Problems in Proof Complexity
