Universal Algebra seminar

Ross Willard, Pure Mathematics, University of Waterloo

"Adding Gaussian elimination to local consistency checking - 2"

In this second 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.