Skip to main content

Research Repository

Advanced Search

The complexity of constraint satisfaction: an algebraic approach

Krokhin, A.; Bulatov, A.; Jeavons, P.

Authors

A. Bulatov

P. Jeavons



Contributors

Valery B. Kudryavtsev
Editor

Ivo G. Rosenberg
Editor

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.

Citation

Krokhin, A., Bulatov, A., & Jeavons, P. (2005). The complexity of constraint satisfaction: an algebraic approach. In V. B. Kudryavtsev, & I. G. Rosenberg (Eds.), Structural theory of automata, semigroups, and universal algebra (181-213). Springer Netherlands. https://doi.org/10.1007/1-4020-3817-8_8

Publication Date Jan 1, 2005
Deposit Date Mar 29, 2010
Publisher Springer Netherlands
Pages 181-213
Series Title NATO science series II : mathematics, physics, chemistry
Book Title Structural theory of automata, semigroups, and universal algebra.
DOI https://doi.org/10.1007/1-4020-3817-8_8
Public URL https://durham-repository.worktribe.com/output/1690190
Additional Information Book series: NATO Science Series II: Mathematics, Physics and Chemistry-Vol.207.



You might also like



Downloadable Citations