Programming Research Group
Research Report RR-04-08
The Complexity of Constraint Satisfaction: An Algebraic Approach
Andrei Krokhin, Andrei Bulatov and Peter Jeavons
May 2004, 36pp.
Abstract
Many computational problems arising in artificial intelligence, computer science and elsewhere
can be represented as constraint satisfaction and optimization problems.
In this survey paper
we discuss an algebraic approach that has proved to be very successful in studying the complexity
of constraint problems.
This paper is available as a 462,093 bytes pdf file.
|
![[Oxford Spires]](/im/spires.gif){kind=small}
oucl