No CrossRef data available.
Published online by Cambridge University Press: 15 December 2002
We investigate well-structured graph-driven parity-FBDDs, which strictly generalizethe two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Booleanfunctions represented by well-structured graph-driven parity-FBDDs in terms ofinvariants of the function represented and the graph-ordering used.As a consequence, we derive a lower bound criterion and prove an exponentiallower bound for certain linear code functions.The second main result of this paper is a polynomial time algorithm thatminimizes the number of nodes in a graph-driven parity-FBDD.