Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


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).

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.

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:http://dx.doi.org/10.1007/1-4020-3817-8_8
Record Created:29 Mar 2010 10:50
Last Modified:14 May 2010 12:51

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library