Given a Binary Decision Diagram $B$ of a Boolean function $\varphi$ in $n$ variables, it is well known that all $\varphi$-models can be enumerated in output polynomial time, and in a compressed way (using don't-care symbols). We show that all $N$ many $\varphi$-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.

翻译：给定一个布尔函数$\varphi$（包含$n$个变量）的二元决策图$B$，众所周知，所有$\varphi$模型可以在输出多项式时间内以压缩方式（使用无关符号）枚举。我们证明，所有固定汉明重量$k$的$N$个$\varphi$模型同样可以在关于$n$、$|B|$和$N$的多项式时间内枚举。此外，通过使用新型通配符，再次实现了对这些模型的压缩枚举。