scientific article; zbMATH DE number 2134905

zbMath1169.03357MaRDI QIDQ4650571

P. W. Beame

Publication date: 18 February 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (5)

Propositional Proofs in Frege and Extended Frege Systems (Abstract) ⋮ Space Complexity in Polynomial Calculus ⋮ Towards NP-P via proof complexity and search ⋮ Unnamed Item ⋮ NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability

This page was built for publication: