Workshop on Computation and Phase Transitions
June 4-7, 2012 at Georgia Tech
To register for the workshop, send an email to
Dani Denton at
Registration is free.
The workshop on Computation and Phase Transitions brings together researchers from Statistical Physics, Probability, Discrete Mathematics, and Theoretical Computer Science. The convergence of ideas from these fields has led to breakthroughs in our understanding of the limits of computation for approximate counting and random sampling problems. For example, recent algorithmic work of Dror Weitz and inapproximability work of Allan Sly shows that the computational complexity of approximately counting weighted independent sets in general graphs undergoes a phase transition that coincides with a classical Statistical Physics phase transition on trees.
Dana Randall, Prasad Tetali, and Eric Vigoda
Georgia Tech School of Computer Science and College of Computing, Algorithms & Randomness Center, ACO Ph.D. Program, National Science Foundation, and Microsoft.