Back to Search
Start Over
Bound-Set Preserving ROB DD Variable Orderings May Not Be Optimum.
- Source :
-
IEEE Transactions on Computers . Feb2005, Vol. 54 Issue 2, p236-237. 2p. - Publication Year :
- 2005
-
Abstract
- This paper reports a result concerning the relation between the best variable orderings of an FIOBDD Gj and the decomposition structure of the Boolean function f represented by Gj. It was stated in [1] that, if f has a decomposition of type f(X) = g(h1(Y1), h2(Y2), … , hk(Yk)), where (Y1), i ϵ (1, 2, … ,k), is a partition of X, then one of the orderings which keeps the variables within the sets (Yi) adjacent is a best ordering for Gj. Using a counterexample, we show that this statement is incorrect. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 54
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 15956875
- Full Text :
- https://doi.org/10.1109/TC.2005.17