Compression with wildcards: All k-models of a binary decision diagram
Marcel Wild, Semegni, Yves · arXiv (Cornell University) · 2017
Given a Binary Decision Diagram $B$ of a Boolean function $φ$ in $n$ variables, it is well known that all $φ$-models can be enumerated in output polynomial time, and in a compressed way (using don't-care symbols). We show that all $N$ many $φ$-models of fixed Hamming-weight $k$ can be enumerated as well in time polynomial in $n$ and $|B|$ and $N$. Furthermore, using novel wildcards, again enables a compressed enumeration of these models.