Learn More
Number of pages: 210 pages Thank you for reading algorithms and data structures in vlsi design obdd foundations and applications. As you may know, people have look numerous times for their favorite books like this algorithms and data structures in vlsi design obdd foundations and applications, but end up in harmful downloads. Rather than enjoying a good(More)
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is non-empty, whether it is a tropical variety, and whether it is connected, as well as counting the number of connected components. We characterize the borderline between tractable and hard computations by(More)
Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of the OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When-nite state machines are represented by OBDDs the state encoding can be used as an additional optimization(More)
Ordered binary decision diagrams are an important data structure for the representation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze the influence of(More)
We propose a new algorithm, called linear sifting, for theoptimization of decision diagrams that combines the efficiency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples, and that inmany cases it leads to substantiallymore compact diagrams when compared to simple variablereordering. We show(More)