Compression with wildcards: All k-models of a binary decision diagram

Marcel Wild, Yves Semegni

Given a Binary Decision Diagram $B$ of a Boolean function $\phi$ in $n$ variables, it is well known that all $\phi$-models can be enumerated in output polynomial time, and in a compresse…