|
Organizers |
Clones and the complexity of constraint satisfaction and optimization
by
Andrei Krokhin
Oxford University Computing Laboratory
I will present some recent results on the complexity of combinatatorial problems that involve constraints. I will show how clones can be used for dealing with such problems, and discuss possibilities for further development of this method.
Date received: February 7, 2002
Copyright © 2002 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 # caht-22.