Constraint Satisfaction and Universal Algebra learning seminar

Renzhi Song, Department of Pure Mathematics, University of Waterloo

“Dichotomy of Conservative CSPs”

This talk is the second of several covering Barto’s simpler proof of a dichotomy for con- servative templates (originally due to Bulatov). We continue from where we left off from last time and finish the proof of the correctness of the reduction to minimal absorbing subuniverses algorithm.