10 research outputs found
SDDs are Exponentially More Succinct than OBDDs
Introduced by Darwiche (2011), sentential decision diagrams (SDDs) are
essentially as tractable as ordered binary decision diagrams (OBDDs), but tend
to be more succinct in practice. This makes SDDs a prominent representation
language, with many applications in artificial intelligence and knowledge
compilation. We prove that SDDs are more succinct than OBDDs also in theory, by
constructing a family of boolean functions where each member has polynomial SDD
size but exponential OBDD size. This exponential separation improves a
quasipolynomial separation recently established by Razgon (2013), and settles
an open problem in knowledge compilation
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
Ordered binary decision diagrams (OBDDs) and several more general BDD models
have turned out to be representations of Boolean functions which are useful
in applications like verification, timing analysis, test pattern generation or
combinatorial optimization.
The hidden weighted bit function (HWB) is of particular interest, since it
seems to be the simplest function with exponential OBDD size.
The complexity of this function with respect to different circuit models,
formulas, and various BDD models is discussed
On the complexity of the hidden weighted bit function for various BDD models
Ordered binary decision diagrams (OBDDs) and several more general BDD models have turned out to be representations of Boolean functions which are useful in applications like verication, timing analysis, test pattern generation or combinatorial optimization. The hidden weighted bit function (HWB) is of particular interest, since it seems to be the simplest function with exponential OBDD size. The complexity of this function with respect to dierent circuit models, formulas, and various BDD models is discussed