Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.03022WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325874

Hans Kleine Büning, Zhao, Xishun

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

68Q25: Analysis of algorithms and problem complexity

03B35: Mechanization of proofs and logical operations

03B05: Classical propositional logic

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Finding read-once resolution refutations in systems of 2CNF clauses