Workshop on Computation and Phase Transitions

Primary tabs

Workshop Theme:

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 the inapproximability work of Allan Sly shows that the computational complexity of approximately counting weighted independent sets in general graphs undergoes a transition that coincides with a classical Statistical Physics phase transition on trees.

ORGANIZING COMMITTEE:   Dana Randall, Prasad Tetali, Eric Vigoda and Dani Denton.


  • Workflow Status: Published
  • Created By: Dani Denton
  • Created: 05/09/2012
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


Target Audience