A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

Friedrich Slivovsky, Stefan Szeider
January 2020
PDF bib

Abstract

Full Citation:

Friedrich Slivovsky, Stefan Szeider. A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. 2020, Technical report AC-TR-20-006, Algorithms and Complexity Group, TU Wien.

Type
Technical Report
Stefan Szeider
Stefan Szeider
Head of Research Unit

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