- About CS
- Future Students
- Current Students
- News & Events
- Active Learning: Nina Balcan Shores Up Foundations of Her Field
- Algorithm for Success: Zvi Galil Brings the Fire to Georgia Tech
- An Agile Architecture: Hyesoon Kim Looks to Combine CPUs & GPUs
- Box Seats in Atlanta: Fortnow Poised to Take School of CS to the Show
- Quantum Resistance: Chris Peikert & the Power of Lattices
- The People’s Network: Computing Students Work for More Transparent Internet
HomeWorkshop on Computation and Phase Transitions
Workshop on Computation and Phase Transitions
Add to Calendar
- June 4, 2012 9:15 am - June 7, 2012 4:00 pm
- Klaus Room 1116
- No charge
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.
Have Questions about this Event?
Dani Denton (denton at cc dot gatech dot edu)