Complexity of propositional proofs (invited talk)

DOI10.1007/978-3-642-13182-0_32MaRDI QIDQ3569758zbMATH OpenOpenAlexFDO

Authors Alexander Razborov

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13182-0_32

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1179974
• scientific article; zbMATH DE number 1390276
• scientific article; zbMATH DE number 1860672
• scientific article; zbMATH DE number 1860652

Cited in

(9)

• On extracting computations from propositional proofs (a survey)
• scientific article; zbMATH DE number 1860652 (Why is no real title available?)
• Unsolvable systems of equations and proof complexity
• Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)
• From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)
• Proof complexity and beyond. Abstracts from the workshop held August 13--19, 2017
• Incompleteness, Undecidability and Automated Proofs
• scientific article; zbMATH DE number 1342249 (Why is no real title available?)
• scientific article; zbMATH DE number 1860672 (Why is no real title available?)

This page was built for publication: Complexity of propositional proofs (invited talk)

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