1. The complexity of the counting constraint satisfaction problem;Bulatov;Autom. Lang. Program.,2010
2. Non-negatively weighted #CSP: an effective complexity dichotomy;Cai,2011
3. A Holant dichotomy: is the FKT algorithm universal?;Cai,2015
4. A complete dichotomy rises from the capture of vanishing signatures;Cai,2013
5. Holographic algorithms with matchgates capture precisely tractable planar #CSP;Cai,2010