My UW  UW Search
Computer Science Home Page
Theory of Computing
People
Courses
Seminars
Student Lunch & Reading Group
Qualifying Exam
Tyson Williams
Courses
Fun Links
Publications
Talks
Teaching
Useful Links
UWM Answers
Videos



Videos
Academic Talks
 Exact Counting
 A Complete Dichotomy Rises from the Capture of Vanishing Signatures by JinYi Cai, Heng Guo, and Tyson Williams [arXiv]
 A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Nonnegative Weights by JinYi Cai and Xi Chen [arXiv, FOCS]
 Complexity of Counting CSP with Complex Weights by JinYi Cai and Xi Chen [arXiv, STOC]
 Graph Homomorphisms with Complex Values: A Dichotomy Theorem by JinYi Cai, Xi Chen, and Pinyan Lu [arXiv, SIAM J. Comput.]
 Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP by JinYi Cai, Pinyan Lu, and Mingji Xia [arXiv, FOCS]
 Nonnegative Weighted #CSPs: An Effective Complexity Dichotomy by JinYi Cai, Xi Chen, and Pinyan Lu [arXiv, CCC]
 On the Complexity of #CSP
 Pfaffian Circuits by Jason Morton [arXiv]
 The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems by by JinYi Cai, Heng Guo, and Tyson Williams [arXiv]
 Decision
 On the CSP Dichotomy Conjecture by Andrei Bulatov [LNCS]
Documentaries
 Biography
 Christianity
 History
 Mathematics
 Nature
 Physics
 Various
Expositories


