3:45 PM-5:45 PM
Room: Capitol South
In past few years, use of methods from graph theory and optimisation in statistical physics has increased markedly. In particular, several hard problems in disordered systems have been related to "easy'' optimization problems, namely those that are precisely solvable in polynomial time. In this minsymposium, the speakers present an introduction to these mappings and their importance in statistical physics and materials theory. They will outline closely related problems for which no good algorithms currently exist.
Organizer: Phillip M. Duxbury
Michigan State University
LMH, 1/19/99, MMD, 3/26/99