scientific article; zbMATH DE number 2212138

MaRDI QIDQ5694881zbMATH OpenFDO

Authors Jan Krajíček

Publication date 5 October 2005

zbMATH Keywords

expository paperhard to prove tautologiesprovabilitysatisfiabilitytruth table function

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Proof Complexity
• scientific article; zbMATH DE number 2110622
• Propositional proof complexity
• Parameterized proof complexity
• scientific article; zbMATH DE number 4053608
• scientific article; zbMATH DE number 4114622
• The Complexity of Propositional Proofs
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1860672
• scientific article; zbMATH DE number 1156870

Cited in

(11)

• Algorithm analysis through proof complexity
• Essential structure of proofs as a measure of complexity
• Proof Complexity and the Kneser-Lovász Theorem
• Twelve Problems in Proof Complexity
• scientific article; zbMATH DE number 4095440 (Why is no real title available?)
• A note on SAT algorithms and proof complexity
• Proof Complexity Meets Algebra
• scientific article; zbMATH DE number 2161249 (Why is no real title available?)
• scientific article; zbMATH DE number 1916823 (Why is no real title available?)
• Usablity of some theorem proving systems
• scientific article; zbMATH DE number 7753415 (Why is no real title available?)

This page was built for publication:

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