Zero-Suppression and Computation Models
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On the other hand, BDDs are also called branching programs in computational complexity theory, and have been studied as a computation model. In this paper, we consider ZDDs from the viewpoint of computational complexity theory. Firstly, we define zero-suppressed branching programs, which actually have the same definition to (unordered) ZDDs, and consider the computational power of zero-suppressed branching programs. Secondly, we attempt to generalize the concept of zero-suppression. We call the basic idea of ZDDs zero-suppression. We show that zero-suppression can be applied to other two classical computation models, decision trees and Boolean formulas.
- 3.Cobham, A.: The recognition problem for the set of perfect squares. In: Proceedings of the 7th Annual Symposium on Switching and Automata Theory, pp. 78–87 (1966)Google Scholar
- 4.Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 1. Addison-Wesley, Boston (2009)Google Scholar
- 6.Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of DAC, pp. 272–277 (1993)Google Scholar