Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325870
DOI10.1007/b95238zbMath1204.68104DBLPconf/sat/2003OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325870
No author found.
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) Nonnumerical algorithms (68W05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Recognition of Nested Gates in CNF Formulas ⋮ Decomposing SAT Instances with Pseudo Backbones ⋮ Counting truth assignments of formulas of bounded tree-width or clique-width ⋮ Davis and Putnam meet Henkin: solving DQBF with resolution
Uses Software
This page was built for publication: Theory and Applications of Satisfiability Testing
