The University of Wisconsin-Madison
   

 
Computer Sciences Department

Videos

Academic Talks

  • Exact Counting
    • Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP by Jin-Yi Cai, Pinyan Lu, and Mingji Xia [arXiv, FOCS]
    • A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights by Jin-Yi Cai and Xi Chen [arXiv, FOCS]
    • Non-negative Weighted #CSPs: An Effective Complexity Dichotomy by Jin-Yi Cai, Xi Chen, and Pinyan Lu [arXiv, CCC]
    • On the Complexity of #CSP
    • Complexity of Counting CSP with Complex Weights by Jin-Yi Cai and Xi Chen [arXiv, STOC]
    • A Complete Dichotomy Rises from the Capture of Vanishing Signatures by Jin-Yi Cai, Heng Guo, and Tyson Williams [arXiv]
  • Approximate Counting
    • Computational Transition at the Uniqueness Threshold by Allan Sly [arXiv, FOCS]
    • Approximating the Tutte Polynomial (and the Potts Partition Function)
  • Decision
    • On the CSP Dichotomy Conjecture by Andrei Bulatov [LNCS]

Documentaries

Expositories

 
Computer Sciences | UW Home
This site has seen Hit Counter by Digits unique visitors.