33 citations · 52 across the 13 of their papers we have counts for
1 paper · 2 filters
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special…