Workshop on Computation and Phase Transitions

Event Details
Contact

Dani Denton (denton at cc dot gatech dot edu)

Summaries

Summary Sentence: No summary sentence submitted.

Full Summary:

A free workshop sponsored by the School of Computer Science's Theory Group, Algorithms & Randomness Center, ACO Ph.D. Program, National Science Foundation, and the Microsoft Corporation.

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.

Additional Information

In Campus Calendar
No
Groups

College of Computing, School of Computer Science

Invited Audience
No audiences were selected.
Categories
Training/Workshop
Keywords
algorithmic_game_theory, algorithms & randomness center, Computational, computer theory, Math and Computing, phase transitions
Status
  • Created By: Dani Denton
  • Workflow Status: Published
  • Created On: May 9, 2012 - 5:59am
  • Last Updated: Oct 7, 2016 - 9:51pm