Universal Algebra Seminar

Ian Payne, Department of Pure Mathematics, University of Waterloo

“A result on constraint satisfaction problems: part 5”

I will talk about Bulatov solutions to instances over the variety of 2-semilattices. Using these, we can get a polynomial time algorithm to solve the constraint satisfaction problem over the join of the variety of 2 semilattices (almost) with the full Maltsev variety. I’ll show how this is done. Hopefully this will be the last lecture, but it may spill into one more.

MC 5403