Home » News » seminar » Eric Vigoda gave a talk on determining computational phase transitions for approximate counting/sampling by Markov Chain Monte Carlo (MCMC) algorithms at the Discrete Math Seminar

Eric Vigoda gave a talk on determining computational phase transitions for approximate counting/sampling by Markov Chain Monte Carlo (MCMC) algorithms at the Discrete Math Seminar

On July 4, 2022, Eric Vigoda from the UC Santa Barbara gave a talk at the Discrete Math Seminar on determining computational phase transitions from the fast mixing to the NP-hardness for approximate counting/sampling by Markov Chain Monte Carlo (MCMC) algorithms. The title of his talk was “Computational phase transition and MCMC algorithms“.