14 citations · 26 across the 14 of their papers we have counts for
1 paper · 2 filters
Andrea Calì, Florent Capelli, Igor Razgon
We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNF-formulas of bounded incidence treewidth. Both models are…