Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider. Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica, 76(1):168-194, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Model Counting for CNF Formulas of Bounded Modular TreewidthDaniël Paulusma, Friedrich Slivovsky, Stefan Szeider. STACS 2013: 55-66 [doi] Model Counting for Formulas of Bounded Clique-WidthFriedrich Slivovsky, Stefan Szeider. isaac 2013: 677-687 [doi]
The following publications are possibly variants of this publication: