58 citations · 327 across the 60 of their papers we have counts for
1 paper · 2 filters
Friedrich Slivovsky, Stefan Szeider
We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-widt…