Twelve Problems in Proof Complexity
From MaRDI portal
Publication:3503621
DOI10.1007/978-3-540-79709-8_4zbMath1142.03369MaRDI 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
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03F20: Complexity of proofs
Related Items
An Introduction to Lower Bounds on Resolution Proof Systems, Compressibility of Finite Languages by Grammars, Towards NP-P via proof complexity and search, On the compressibility of finite languages and formal proofs, On the cover complexity of finite languages, Propositional Proofs in Frege and Extended Frege Systems (Abstract)