A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

Friedrich Slivovsky, Stefan Szeider
January 2020
bib Project Project Project

Abstract

Full Citation:

Friedrich Slivovsky, Stefan Szeider. A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 267-276, 2020, Springer Verlag.

Type
Conference Paper
L2solve Reveal Slim
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.