A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Complexity of Minimizing FBDDs
[chapter]
1999
Lecture Notes in Computer Science
Free Binary Decision Diagrams (FBDDs) are a data structure for the representation and manipulation of Boolean functions. Efficient algorithms for most of the important operations are known if only FBDDs respecting a fixed graph ordering are considered. However, the size of such an FBDD may strongly depend on the chosen graph ordering and efficient algorithms for computing good or optimal graph orderings are not known. In this paper it is shown that the existence of polynomial time approximation
doi:10.1007/3-540-48340-3_23
fatcat:hmbdh6p5mvgtxa4bqd4ecr35we