Lee-Yang Zeros and the Complexity of the Ferromagnetic Ising Model on Bounded-Degree Graphs
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=7RvLTcCrh3o
Guus Regts (University of Amsterdam)
Geometry of Polynomials Reunion
https://simons.berkeley.edu/talks/lee-yang-zeros-and-complexity-ferromagnetic-ising-model-bounded-degree-graphs
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing