Model Counting for Formulas of Bounded Clique-Width
From MaRDI portal
Publication:2872132
DOI10.1007/978-3-642-45030-3_63zbMath1406.68046arXiv1409.8464OpenAlexW2964174631MaRDI QIDQ2872132
Friedrich Slivovsky, Stefan Szeider
Publication date: 14 January 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8464
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
On Compiling CNFs into Structured Deterministic DNNFs ⋮ Sum-of-Products with Default Values: Algorithms and Complexity Results ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Unnamed Item
This page was built for publication: Model Counting for Formulas of Bounded Clique-Width