{"129241":{"#nid":"129241","#data":{"type":"event","title":"Workshop on Computation and Phase Transitions","body":[{"value":"\u003Cp class=\u0022FreeForm\u0022\u003E\u003Cstrong\u003EWorkshop Theme:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022FreeForm\u0022\u003EThe 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.\u003C\/p\u003E\u003Cp class=\u0022FreeForm\u0022\u003EORGANIZING COMMITTEE:\u0026nbsp; \u0026nbsp;\u003Cstrong\u003EDana Randall\u003C\/strong\u003E, \u003Cstrong\u003EPrasad Tetali\u003C\/strong\u003E, \u003Cstrong\u003EEric Vigoda and Dani Denton. \u003C\/strong\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp class=\u0022FreeForm\u0022\u003E\u003Cstrong\u003EA free workshop sponsored by the School of Computer Science\u0027s Theory Group, Algorithms \u0026amp; Randomness Center, ACO Ph.D. Program, National Science Foundation, and the Microsoft Corporation.\u003C\/strong\u003E\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":"","uid":"27466","created_gmt":"2012-05-09 09:59:00","changed_gmt":"2016-10-08 01:51:25","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2012-06-04T10:15:00-04:00","event_time_end":"2012-06-07T17:00:00-04:00","event_time_end_last":"2012-06-07T17:00:00-04:00","gmt_time_start":"2012-06-04 14:15:00","gmt_time_end":"2012-06-07 21:00:00","gmt_time_end_last":"2012-06-07 21:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"8438","name":"algorithmic_game_theory"},{"id":"12781","name":"algorithms \u0026 randomness center"},{"id":"5637","name":"Computational"},{"id":"15721","name":"computer theory"},{"id":"14837","name":"Math and Computing"},{"id":"32941","name":"phase transitions"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"26411","name":"Training\/Workshop"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton (denton at cc dot gatech dot edu)\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}