![Counting Complexity and Phase Transitions_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Counting%20Complexity%20and%20Phase%20Transitions_hi-res.jpg?h=bf33d09a&itok=MrH5eN5T)
Abstract
This first session will be an introduction to the Fisher-Kasteleyn-Temperley algorithm, Pfaffians and matchgates, and to Valiant's holographic algorithms based on matchgates.
The second session of this mini course will take place on Wednesday, January 27 from 11:00 am – 12:00 pm; the third session of this mini course will take place on Thursday, January 28 from 11:00 am – 12:00 pm.