| Issue |
RAIRO-Theor. Inf. Appl.
Volume 33, Number 2, March April 1999
|
|
|---|---|---|
| Page(s) | 103 - 115 | |
| DOI | https://doi.org/10.1051/ita:1999108 | |
| Published online | 15 August 2002 | |
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany.
Received:
February
1998
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.