The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.
Recursive Random Fields Daniel Lowd University of Washington (Joint work with Pedro Domingos)
Endre Szemerédi & TCS Avi Wigderson IAS, Princeton.
Shatter : Efficient Symmetry-Breaking for Boolean Satisfiability
Endre Szemerédi & TCS
Global Constraints
Department of Computer Science, Wayne State University
The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies
