The Complexity of Constraint Satisfaction: An Algebraic Approach

Andrei Krokhin, Andrei Bulatov and Peter Jeavons

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.

info

links

BibTeX

Download (pdf)

related pages