44 citations · 82 across the 8 of their papers we have counts for
1 paper · 1 filter
Jason Morton, Jacob Turner
Generalized counting constraint satisfaction problems include Holant problems with planarity restrictions; polynomial-time algorithms for such problems include matchgates and match…