9 citations · 72 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 9 cited
On OBDDs for CNFs of bounded treewidth
Igor Razgon
In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph treewidth of the CNF. T…
cs.LO2013
Cliquewidth and Knowledge Compilation
Igor Razgon, Justyna Petke
In this paper we study the role of cliquewidth in succinct representation of Boolean functions. Our main statement is the following: Let be a Boolean circuit having cliquewidth…