Jin-Yi Cai
Affiliations: | University of Wisconsin, Madison, Madison, WI |
Area:
Computer ScienceGoogle:
"Jin-Yi Cai"Children
Sign in to add trainee| Venkatesan T. Chakaravarthy | grad student | 2004 | UW Madison |
| Michael R. Kowalczyk | grad student | 2010 | UW Madison |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Cai J, Govorov A. (2021) On a Theorem of Lovász that (&sdot, H ) Determines the Isomorphism Type of H Acm Transactions On Computation Theory. 13: 1-25 |
| Cai J, Fu Z, Shao S. (2020) Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS Information & Computation. 104589 |
| Cai J, Lu P, Xia M. (2020) Dichotomy for Holant ∗ Problems on the Boolean Domain Theory of Computing Systems \/ Mathematical Systems Theory. 1-30 |
| Cai J, Kowalczyk M, Williams T. (2019) Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy Acm Transactions On Computation Theory. 11: 1-26 |
| Cai J, Chen X. (2019) A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights Computational Complexity. 28: 345-408 |
| Cai J, Fu Z, Xia M. (2018) Complexity classification of the six-vertex model Information & Computation. 259: 130-141 |
| Cai J, Guo H, Williams T. (2018) Holographic Algorithms Beyond Matchgates Information & Computation. 259: 102-129 |
| Cai J, Chen X. (2017) Complexity of Counting CSP with Complex Weights Journal of the Acm. 64: 1-39 |
| Cai J, Lu P, Xia M. (2017) Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Siam Journal On Computing. 46: 853-889 |
| Cai J, Guo H, Williams T. (2016) The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems Research in the Mathematical Sciences. 3: 18 |