Twelve Problems in Proof Complexity

DOI10.1007/978-3-540-79709-8_4MaRDI QIDQ3503621zbMATH OpenOpenAlexFDO

Authors Pavel Pudlák

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

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 1346358
• scientific article; zbMATH DE number 1860654
• Hilbert's Twelfth Problem
• The Complexity of Propositional Proofs
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1156870
• scientific article; zbMATH DE number 1860672
• Proof Complexity and the Kneser-Lovász Theorem
• scientific article; zbMATH DE number 2212138
• Proof Complexity

Cited in

(9)

• On the compressibility of finite languages and formal proofs
• On the cover complexity of finite languages
• Proof complexity and textual cohesion
• Propositional proofs in Frege and extended Frege systems (abstract)
• Towards NP-P via proof complexity and search
• Towards NP-P via proof complexity and search
• An Introduction to Lower Bounds on Resolution Proof Systems
• Compressibility of Finite Languages by Grammars
• Logical Approaches to Computational Barriers

This page was built for publication: Twelve Problems in Proof Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503621)