Computation and Phase Transitions Workshop

Event Details
  • Date/Time:
    • Monday June 4, 2012 - Friday June 8, 2012
      1:00 pm - 8:59 pm
  • Location: Klaus 1116
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:


Summary Sentence: No summary sentence submitted.

Full Summary: No summary paragraph submitted.

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 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.



Additional Information

In Campus Calendar

School of Computer Science, ARC

Invited Audience
No audiences were selected.
No categories were selected.
No keywords were submitted.
  • Created By: Elizabeth Ndongi
  • Workflow Status: Published
  • Created On: Apr 16, 2012 - 5:55am
  • Last Updated: Oct 7, 2016 - 9:58pm