A simplified proof that regular resolution is exponential

DOI10.1016/S0020-0190(80)90082-4MaRDI QIDQ1141648zbMATH OpenOpenAlexFDO

Authors Mordechai Ben-Ari

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(80)90082-4

zbMATH Keywords

proof treesregular resolution is exponential

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Cites work

• On the complexity of regular resolution and the Davis-Putnam procedure

Cited in

(1)

• The complexity of Gentzen systems for propositional logic

This page was built for publication: A simplified proof that regular resolution is exponential

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