FPTAS for Holant Problems with Log-Concave Signatures

Kun He, Zhidan Li, Guoliang Qiu +1

For an integer $b\ge 0$, a $b$-matching in a graph $G=(V,E)$ is a set $S\subseteq E$ such that each vertex $v\in V$ is incident to at most $b$ edges in $S$. We design a fully polyn…