Universal Algebra seminar

Tuesday, October 14, 2014 10:30 am - 10:30 am EDT

Ross Willard, Department of Pure Mathematics, University of Waterloo

“Adding Gaussian elimination to local consistency checking”

In this first of several lectures, I will present a polynomial-time consistency checking algorithm for constraint networks over a finite template having a Taylor polymorphism. I conjecture that the algorithm is complete for Maltsev templates, and in future lectures will provide evidence supporting this conjecture.