![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
I will discuss the current understanding of the power of holographic algorithms with matchgates. The focus will be on the Universality of this class of algorithms for those #CSP type problems that are #P-hard in general, yet solvable over planar graphs.