scientific article; zbMATH DE number 2134905

MaRDI QIDQ4650571zbMATH OpenFDO

Authors Paul Beame

Publication date 18 February 2005

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(5)

• Space complexity in polynomial calculus
• Propositional proofs in Frege and extended Frege systems (abstract)
• NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
• Towards NP-P via proof complexity and search
• scientific article; zbMATH DE number 7561762 (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 Q4650571)