Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325874
DOI10.1007/b95238zbMath1204.03022OpenAlexW2494235144WikidataQ56039662 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
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Analyzing read-once cutting plane proofs in Horn systems ⋮ Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ Finding read-once resolution refutations in systems of 2CNF clauses
This page was built for publication: Theory and Applications of Satisfiability Testing
