Report icon

Report

The Complexity of Constraint Satisfaction: An Algebraic Approach

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.

Actions


Access Document


Files:

Authors


Andrei Krokhin More by this author
Andrei Bulatov More by this author
Peter Jeavons More by this author
Publisher:
Oxford University Computing Laboratory
Publication date:
2004-05-01
URN:
uuid:fa9894ee-740f-4ce3-9a61-f408b510687f
Local pid:
cs:31

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP