• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

If you are tweeting about the workshop, please use the designated hashtag to enable other participants to follow the discussions online. The hashtag for this workshop is #sicpcc.

–
Coffee & Check-In
–
Opening Remarks
–
Approximately Counting Graph Homomorphisms
Leslie Ann Goldberg, University of Oxford
–
Spin Systems: Hardness of Approximate Counting via Phase Transitions
Andreas Galanis, University of Oxford
–
Break
–
Approximating 2-State Spin Systems
Heng Guo, Queen Mary, University of London
–
Lunch
–
Counting in Sparse Classes of Structures
Jaroslav Nesetril, Charles University
–
Fine-Grained Complexity Classification of Counting Problems
Holger Dell, Universität des Saarlandes
–
Light Refreshments (Banatao Auditorium, Sutardja Dai Hall)
–
Simons Institute Open Lecture: The Complexity of Computing Quantities
Leslie Valiant (Harvard University)
–
Coffee & Check-In
–
On the Power of Holographic Algorithms with Matchgates
Jin-Yi Cai (University of Wisconsin-Madison)
–
Basis Collapse for Holographic Algorithms Over all Domain Sizes
Sitan Chen, Harvard University
–
Break
–
Approximation Algorithms for Partition Functions of Edge-Coloring Models
Guus Regts, University of Amsterdam
–
Lunch
–
Path Coupling, Metrics, and Sampling Problems in Graphs and Hypergraphs
Martin Dyer, University of Leeds
–
Counting Matrix Partitions of Graphs
David Richerby, University of Oxford
–
Break
–
How to Not Prove Two Important Theorems
Richard Lipton, Georgia Institute of Technology
–
Reception
–
Coffee & Check-In
–
The Computational Complexity of Counting List H-Colourings, and Related Problems
Mark Jerrum, Queen Mary, University of London
–
Towards Understanding the Complexity of the Ising Partition Function
Martin Loebl, Charles University
–
Break
–
The Complexity of Computing Averages
Piyush Srivastava, California Institute of Technology
–
Lunch
–
The Complexity of Approximating Small Degree Boolean #CSP
Pinyan Lu (Shanghai University of Finance and Economics)
–
Canonical Paths for MCMC: From Art to Science
Chihao Zhang, Shanghai Jiao Tong University
–
Break
–
Dichotomies for Counting Subgraphs
Radu Curticapean (Hungarian Academy of Sciences)
–
Coffee & Check-In
–
Counting Approximation Complexity Classification Through Clones and Invariants
Andrei Bulatov (Simon Fraser University), Andrei Bulatov (Simon Fraser University), Andrei Bulatov (Simon Fraser University)
–
Enumerator Polynomials: Completeness and Intermediate Complexity
Meena Mahajan, 
–
Break
–
Dichotomy Theorems for Generalized Chromatic Polynomials
Johann Makowsky, Technion Israel Institute of Technology
–
Lunch
–
Geometric Perspectives on Problems in Complexity Theory
JM Landsberg (Texas A&M University)
–
Categories, Representations, and Counting Complexity
Jason Morton, Pennsylvania State University
–
Break
–
Hilbert's Nullstellensatz Certificates of Infeasibility for Combinatorial Problems
Susan Margulies, United States Naval Academy
–
Coffee & Check-In
–
Finding a Large Submatrix of a Random Matrix, and the Overlap Gap Property
David Gamarnik, Massachusetts Institute of Technology
–
LP Relaxations for Valued CSPs
Stanislav Zivny (University of Oxford)
–
Break
–
Counting with Bounded Treewidth
Yitong Yin, Nanjing University