Cai, Jin-Yi; Fan, Austen Z.; Liu, Yin Bipartite 3-regular counting problems with mixed signs. (English) Zbl 07677365 J. Comput. Syst. Sci. 135, 15-31 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., J. Comput. Syst. Sci. 135, 15--31 (2023; Zbl 07677365) Full Text: DOI
Govorov, Artem; Cai, Jin-Yi; Dyer, Martin A dichotomy for bounded degree graph homomorphisms with nonnegative weights. (English) Zbl 07639675 J. Comput. Syst. Sci. 132, 1-15 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Govorov} et al., J. Comput. Syst. Sci. 132, 1--15 (2023; Zbl 07639675) Full Text: DOI arXiv
Cai, Jin-Yi; Govorov, Artem Perfect matchings, rank of connection tensors and graph homomorphisms. (English) Zbl 1510.05238 Comb. Probab. Comput. 31, No. 2, 268-303 (2022). MSC: 05C70 05C25 05C60 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{A. Govorov}, Comb. Probab. Comput. 31, No. 2, 268--303 (2022; Zbl 1510.05238) Full Text: DOI
Cai, Jin-Yi; Fan, Austen Z.; Liu, Yin Bipartite 3-regular counting problems with mixed signs. (English) Zbl 07530229 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 135-148 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Lect. Notes Comput. Sci. 12867, 135--148 (2021; Zbl 07530229) Full Text: DOI arXiv
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji Dichotomy for Holant\(^\ast\) problems on the Boolean domain. (English) Zbl 1503.68199 Theory Comput. Syst. 64, No. 8, 1362-1391 (2020). MSC: 68R05 68Q17 68Q25 68R07 68R10 68W05 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Theory Comput. Syst. 64, No. 8, 1362--1391 (2020; Zbl 1503.68199) Full Text: DOI Link
Cai, Jin-Yi; Chen, Xi A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. (English) Zbl 1429.68079 Comput. Complexity 28, No. 3, 345-408 (2019). MSC: 68Q25 05C20 05C60 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{X. Chen}, Comput. Complexity 28, No. 3, 345--408 (2019; Zbl 1429.68079) Full Text: DOI arXiv
Cai, Jin-Yi; Guo, Heng; Williams, Tyson Holographic algorithms beyond matchgates. (English) Zbl 1390.68338 Inf. Comput. 259, Part 1, 102-129 (2018). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Inf. Comput. 259, Part 1, 102--129 (2018; Zbl 1390.68338) Full Text: DOI arXiv
Cai, Jin-Yi; Chen, Xi; Lu, Pinyan Nonnegative weighted #CSP: an effective complexity dichotomy. (English) Zbl 1356.68094 SIAM J. Comput. 45, No. 6, 2177-2198 (2016). MSC: 68Q25 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., SIAM J. Comput. 45, No. 6, 2177--2198 (2016; Zbl 1356.68094) Full Text: DOI arXiv
Kowalczyk, Michael; Cai, Jin-Yi Holant problems for 3-regular graphs with complex edge functions. (English) Zbl 1350.68151 Theory Comput. Syst. 59, No. 1, 133-158 (2016). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{M. Kowalczyk} and \textit{J.-Y. Cai}, Theory Comput. Syst. 59, No. 1, 133--158 (2016; Zbl 1350.68151) Full Text: DOI Link
Cai, Jin-Yi; Guo, Heng; Williams, Tyson A complete dichotomy rises from the capture of vanishing signatures. (English) Zbl 1350.68133 SIAM J. Comput. 45, No. 5, 1671-1728 (2016). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., SIAM J. Comput. 45, No. 5, 1671--1728 (2016; Zbl 1350.68133) Full Text: DOI arXiv
Cai, Jin-Yi; Kowalczyk, Michael Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions. (English) Zbl 1300.05246 Theor. Comput. Sci. 494, 63-74 (2013). MSC: 05C70 05C85 05C60 68Q17 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{M. Kowalczyk}, Theor. Comput. Sci. 494, 63--74 (2013; Zbl 1300.05246) Full Text: DOI
Cai, Jin-Yi; Huang, Sangxia; Lu, Pinyan From Holant to #CSP and back: dichotomy for Holant\(^{c}\) problems. (English) Zbl 1255.68079 Algorithmica 64, No. 3, 511-533 (2012). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Algorithmica 64, No. 3, 511--533 (2012; Zbl 1255.68079) Full Text: DOI
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji A computational proof of complexity of some restricted counting problems. (English) Zbl 1216.68122 Theor. Comput. Sci. 412, No. 23, 2468-2485 (2011). MSC: 68Q25 05C22 68-04 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Theor. Comput. Sci. 412, No. 23, 2468--2485 (2011; Zbl 1216.68122) Full Text: DOI