Computation and Phase Transitions Workshop
- June 4, 2012 9:00 am - June 7, 2012 5:00 pm
- Klaus 1116
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 transtion on trees.