1 paper
Jin-Yi Cai, Jin Soo Ihm
Holant problems are a general framework to study the computational complexity of counting problems. It is a more expressive framework than counting constraint satisfaction problems…