1. Backens, M.: A new Holant dichotomy inspired by quantum computation. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP, pp. 16:1–16:14 (2017)
2. Backens, M.: A complete dichotomy for complex-valued $$\operatorname{Holant}^{c}$$. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP, pp. 12:1–12:14 (2018)
3. Backens, M., Goldberg, L.A.: Holant clones and the approximability of conservative Holant problems. ACM Trans. Algorithms 16(2), 23:1–23:55 (2020)
4. Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM (JACM) 53(1), 66–120 (2006)
5. Cai, J., Chen, X.: Complexity Dichotomies for Counting Problems: Boolean Domain, vol. 1. Cambridge University Press, Cambridge (2017)