Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models

Beate BolligMartin LöbbingMartin SauerhoffIngo Wegener — 2010

RAIRO - Theoretical Informatics and Applications

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...

Page 1

Download Results (CSV)