Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325859
DOI10.1007/b95238zbMath1204.68186OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325859
Satyanarayana V. Lokam, Elizabeth Broering
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
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
On the Satisfiability of Quantum Circuits of Small Treewidth ⋮ On the satisfiability of quantum circuits of small treewidth ⋮ Size-treewidth tradeoffs for circuits computing the element distinctness function ⋮ Empirical Study of the Anatomy of Modern Sat Solvers
This page was built for publication: Theory and Applications of Satisfiability Testing
