Spin Systems: Hardness of Approximate Counting via Phase Transitions
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=XLzeAni09Uc
Andreas Galanis, University of Oxford
The Classification Program of Counting Complexity
https://simons.berkeley.edu/talks/andreas-galanis-2016-03-28
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Andreas Galanis