In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval graphs, interval graphs and bipartite graphs are investigated. Upper and lower bounds are proven for all these graph classes and it is shown that in most (but not all) cases a representation of the graphs by OBDDs is advantageous ...

We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| ≥ 213. 1998 ACM Subject Classification F.2.3 Tradeoffs between Complexity Measures

In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...

We prove that the graph of integer multiplication requires non-deterministic read-k-times branching programs of exponential size. On the other hand we show that one can add polynomially many integers by small determin-istic read-once-only branching programs. This shows that the reason for the hardness of multiplication is not the necessity to add many integers (and hence, to get rid of the carr...

Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider issues regarding the efficient implementation of a package for the creation and manipulation of multiple-valued decision diagrams (MDDs). In particular, we identify issues that differ from binary decision diagram packages. We describe a matrix method for level interch...

We propose a novel method of reduction for binary-based decision diagrams (DD) exploiting the similarities between Boolean functions. Conventional methods are able to remove redundant parts DD that adhere (or represent) identical structures. The proposed approach tries take advantage not only but also equivalent diagram, which produce results after change in variable ordering. Basic types DD, l...