The following publications are possibly variants of this publication:
- From Holant to #CSP and Back: Dichotomy for Holant:::::::c::::::: ProblemsJin-yi Cai, Sangxia Huang, Pinyan Lu. isaac 2010: 253-265 [doi]
- Holant problems and counting CSPJin-yi Cai, Pinyan Lu, Mingji Xia. stoc 2009: 715-724 [doi]
- A Dichotomy for Real Boolean Holant ProblemsShuai Shao 0001, Jin-yi Cai. focs 2020: 1091-1102 [doi]
- Dichotomy for Holant* Problems of Boolean DomainJin-yi Cai, Pinyan Lu, Mingji Xia. soda 2011: 1714-1728 [doi]
- A Dichotomy for Real Weighted Holant ProblemsSangxia Huang, Pinyan Lu. coco 2012: 96-106 [doi]
- A Dichotomy for Real Weighted Holant ProblemsSangxia Huang, Pinyan Lu. cc, 25(1):255-304, 2016. [doi]
- From Holant to Quantum Entanglement and BackJin-yi Cai, Zhiguo Fu, Shuai Shao 0001. icalp 2020: [doi]
- Dichotomy for Holant* Problems with Domain Size 3Jin-yi Cai, Pinyan Lu, Mingji Xia. soda 2013: 1278-1295 [doi]
- The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant ProblemsJin-yi Cai, Heng Guo, Tyson Williams. focs 2014: 601-610 [doi]
- A Holant Dichotomy: Is the FKT Algorithm Universal?Jin-yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams. focs 2015: 1259-1276 [doi]
- On the Complexity of Holant ProblemsHeng Guo, Pinyan Lu. In Andrei A. Krokhin, Stanislav Zivny, editors, The Constraint Satisfaction Problem: Complexity and Approximability. Volume 7 of Dagstuhl Follow-Ups, pages 159-177, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
- Computational Complexity of Holant ProblemsJin-yi Cai, Pinyan Lu, Mingji Xia. SICOMP, 40(4):1101-1132, 2011. [doi]