Single Family Algebra Operation on BDDs and ZDDs Leads To Exponential Blow-Up (2403.05074v2)
Abstract: Binary decision diagram (BDD) and zero-suppressed binary decision diagram (ZDD) are data structures to represent a family of (sub)sets compactly, and it can be used as succinct indexes for a family of sets. To build BDD/ZDD representing a desired family of sets, there are many transformation operations that take BDDs/ZDDs as inputs and output BDD/ZDD representing the resultant family after performing operations such as set union and intersection. However, except for some basic operations, the worst-time complexity of taking such transformation on BDDs/ZDDs has not been extensively studied, and some contradictory statements about it have arisen in the literature. In this paper, we show that many transformation operations on BDDs/ZDDs, including all operations for families of sets that appear in Knuth's book, cannot be performed in worst-case polynomial time in the size of input BDDs/ZDDs. This refutes some of the folklore circulated in past literature and resolves an open problem raised by Knuth. Our results are stronger in that such blow-up of computational time occurs even when the ordering, which has a significant impact on the efficiency of treating BDDs/ZDDs, is chosen arbitrarily.
- B. Bollig. A simpler counterexample to a long-standing conjecture on the complexity of Bryant’s apply algorithm. Information Processing Letters, 114(3):124–129, 2014.
- R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computing, C-35(8):677–691, 1986.
- O. Coudert. Solving graph optimization problems with ZBDDs. In Proc. of the European Design & Test Conference (ED&TC 97), pages 224–228, 1997.
- A new viewpoint on two-level logic minimization. In Proc. of the 30th ACM/IEEE Design Automation Conference (DAC 1993), pages 625–630, 1993.
- Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs. In Proc. of the Computational Intelligence in Information System (CIIS 2016), pages 294–305, 2016.
- D. E. Knuth. The art of computer programming: Vol. 4A. Combinatorial Algorithms, Part 1, volume 4A: Combinatorial Algorithms, Part I. Addison-Wesley Professional, 2011.
- S. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proc. of the 30th ACM/IEEE Design Automation Conference (DAC 1993), pages 272–277, 1993.
- S. Minato. Calculation of unate cube set algebra using zero-suppressed BDDs. In Proc. of the 31st ACM/IEEE Design Automation Conference (DAC 1994), pages 420–424, 1994.
- S. Minato. Zero-suppressed BDDs and their applications. International Journal on Software Tools for Technology Transfer, 3:156–170, 2001.
- On the properties of combination set operations. Information Processing Letters, 66(4):195–199, 1998.
- F. Somenzi. CUDD: CU decision diagram package, 1997. https://github.com/ivmai/cudd.
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Information Processing Letters, 112(16):636–640, 2012.