The University of Wisconsin-Madison
   

 
Computer Sciences Department

Videos

Documentaries

Counting Talks

  • Exact Counting
    • Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP by Jin-Yi Cai, Pinyan Lu, and Mingji Xia (paper) (talk by Pinyan Lu at FOCS 2010)
    • A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights by Jin-Yi Cai and Xi Chen (paper) (talk by Xi Chen at FOCS 2010)
    • Non-negative Weighted #CSPs: An Effective Complexity Dichotomy by Jin-Yi Cai, Xi Chen, and Pinyan Lu (paper) (talk by Xi Chen at IAS)
    • On the Complexity of #CSP (talk by Martin Dyer at CIOG Workshop)
    • Complexity of Counting CSP with Complex Weights by Jin-Yi Cai and Xi Chen (paper) (talk by Xi Chen at CIOG Workshop)
  • Approximate Counting
    • Computational Transition at the Uniqueness Threshold by Allan Sly (paper) (talk by Allan Sly at FOCS 2010)
    • Approximating the Partition Function of the Ferromagnetic Ising Model (talk by Mark Jerrum at CIOG Workshop)
    • Approximating the Tutte Polynomial (and the Potts Partition Function) (talk by Leslie Ann Goldberg at CIOG Workshop)
    • Approximate Counting via Correlation Decay in Spin Systems (paper) (talk by Pinyan Lu at CIOG Workshop)

Expositories

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