scientific article; zbMATH DE number 2086624

MaRDI QIDQ4737159zbMATH OpenFDO

Authors Juan Luis Esteban, Nicola Galesi, Jochen Messner

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800220.htm

zbMATH Keywords

complexity of proofsresolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of resolution with bounded conjunctions
• Exponential separation between Res(k) and Res(k+1) for k n
• On resolution with short clauses
• scientific article; zbMATH DE number 1424047
• On the relative complexity of resolution refinements and cutting planes proof systems

Cited in

(6)

• On the automatizability of resolution and related propositional proof systems
• On the complexity of resolution with bounded conjunctions
• A tutorial on time and space bounds in tree-like resolution
• scientific article; zbMATH DE number 1948189 (Why is no real title available?)
• scientific article; zbMATH DE number 1929954 (Why is no real title available?)
• Exponential separation between Res(k) and Res(k+1) for k n

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 Q4737159)