|
Organizers |
Algebraic methods in the Constraint Satisfaction Problem
by
Andrei Bulatov
Ural State university (Ekaterinburg, Russia)
The Constraint Satisfaction Problem (CSP) provides a general framework for a huge variety of combinatorial problems. The links between CSP and some areas of universal algebra established by P.Jeavons and coathors allows us to make a breakthrough in study CSP. In this talk we further develop the algebraic approach to CSP, and show how some notions and results of tame congruence theory can be used.
Date received: December 30, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caig-21.