Binary Decision Diagrams: from Tree Compaction to Sampling

Julien Clément, Antoine Genitrini

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common…