Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian, Petr Hliněný, Jan Óbdržálek · Fundamenta Informaticae · 2013
We provide a parameterized algorithm for the propositional model counting problem #SAT, the runtime of which has a single-exponential dependency on the rank-width of the signed graph of a formula. That is, our algorithm runs in time $\cal{O}(t^3 \cdo