On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany.
Accepted: September 1998
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.
Mathematics Subject Classification: 68Q05 / 68Q15 / 94C10
Key words: Complexity / binary decision diagram / OBDD / hidden weighted bit function.
© EDP Sciences, 1999