Hausdorff School: Random Constraint Satisfaction

Dates: July 17-21, 2017

Venue: Lipschitz Hall, Endenicher Allee 60

Organizer: Joe Neeman


Constraint satisfaction problems such as graph coloring and boolean satisfiability are fundamental for understanding computational complexity and certain physical processes. Randomly generated instances of these problems are known to have intricate probabilistic structure, and recent work has made good progress in uncovering this structure.

This Hausdorff school is intended for motivated graduate and postdoctoral students who want to get acquainted with this area, its new developments, and the new probabilistic tools that led to them.


  • Amin Coja-Oghlan (Goethe University)
  • Cristopher Moore (Santa Fe Institute)
  • Daniel Stefankovic (University of Rochester)

 In case you are interested in participating, please fill out the application form. The deadline for applications is 30th April 2017. All applications, submitted after that will be considered on an individual basis.

For questions please contact joe.neeman(at) .