We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

The complexity of constraint satisfaction : an algebraic approach.

Krokhin, A. and Bulatov, A. and Jeavons, P. (2005) 'The complexity of constraint satisfaction : an algebraic approach.', in Structural theory of automata, semigroups, and universal algebra. Dordrecht, The Netherlands: Springer Netherlands, pp. 181-213. NATO science series II : mathematics, physics, chemistry. (207).


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.

Item Type:Book chapter
Additional Information:Proceedings of the NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra Montreal, Quebec, Canada 7–18 July 2003.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:2005
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar