Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325874zbMATH OpenOpenAlexFDO

Authors Hans Kleine Büning, Xishun Zhao

Publication date 24 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• The complexity of read-once resolution
• scientific article; zbMATH DE number 1765669
• Copy complexity of Horn formulas with respect to unit read-once resolution
• The complexity of finding read-once NAE-resolution refutations
• Finding read-once resolution refutations in systems of 2CNF clauses

Cited in

(5)

• The complexity of read-once resolution
• Copy complexity of Horn formulas with respect to unit read-once resolution
• Finding read-once resolution refutations in systems of 2CNF clauses
• Analyzing read-once cutting plane proofs in Horn systems
• scientific article; zbMATH DE number 1440912 (Why is no real title available?)

This page was built for publication: Theory and Applications of Satisfiability Testing

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