… the known approaches to produce reduced OBDDs and in Section 3 we present a new
reduction algorithm. … At the end we have constructed the reduced OBDD, since we have ap- …

… in linear time by simply traversing the OBDD … reduction rules in the postorder traversal of
Apply. In the future we will only speak of OBDDs, however we always mean reduced OBDDs. …

… We notice that there exists an OBDD(∧,∃) algorithm that … polynomial time (a standard
example of a hard system of linear … systems of linear equations over F2 that are hard for OBDD(∧,…

… Moreover, the same holds if we look for a small sample whose reduction yields an order
that is efficiently transformable at least to a better order for the entire OBDDs. Therefore, a real …

… by introducing linear transformations in OBDDs or generalizations of OBDDs. In order to
explain the differences between ordinary OBDDs and OBDDs with linear transformations we first …

… OBDDs. In order to explain the differences between ordinary OBDDs and OBDDs with linear
transformations we first recall the definition of BDDs/branching programs and of OBDDs. A …

… In order to obtain the total size of a reduced OBDD for f we have to sum up certain values
Tj (·, ·). We determine these values by means of a grid graph. The node set of the grid graph is …

… discuss only reduced OBDDs. For the proofs the following structural result (Sieling and
Wegener [ 171) is useful. It describes which functions are represented in the reduced OBDD for f. …

… OBDDs are customarily requested to be reduced OBDDs [1]. There are many efficient
algorithms to perform all kinds of logic operations on OBDD’s. It is well-known that the problem sat- …

… Unless otherwise stated, we will always consider the reduced OBDD… It is wellknown that a
reduced OBDD is a canonical … an OBDD can be converted to a reduced OBDD by a linear time …