|Computer Science/Discrete Mathematics Seminar II|
|Topic:||Constraint Satisfaction Problems and Probabilistic Combinatorics II|
|Affiliation:||Member, School of Mathematics|
|Date:||Tuesday, November 26|
|Time/Room:||10:30am - 12:30pm/Simonyi Hall 101|
The tasks of finding and randomly sampling solutions of constraint satisfaction problems over discrete variable sets arise naturally in a wide variety of areas, among them artificial intelligence, bioinformatics and combinatorics, and further have deep connections to statistical physics.
In this second talk of the series, I'll cover some results regarding random constraint satisfaction problems and their connection to statistical physics.