7 citations · 17 across the 14 of their papers we have counts for
1 paper · 1 filter
Jiabao Lin, Hanpin Wang
Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain wi…