The Complexity of Constraint Satisfaction: An Algebraic ApproachReport as inadecuate




The Complexity of Constraint Satisfaction: An Algebraic Approach - Download this document for free, or read online. Document in PDF available to download.

Reference: Andrei Krokhin, Andrei Bulatov and Peter Jeavons, (2004). The Complexity of Constraint Satisfaction: An Algebraic Approach.Citable link to this page:

 

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.

Bibliographic Details

Publisher: Oxford University Computing Laboratory

Issue Date: 2004-05-01Identifiers

Urn: uuid:fa9894ee-740f-4ce3-9a61-f408b510687f Item Description

Type: Report; Tiny URL: cs:31

Relationships





Author: Andrei Krokhin - - - Andrei Bulatov - - - Peter Jeavons - - - - Bibliographic Details Publisher: Oxford University Computing Labo

Source: https://ora.ox.ac.uk/objects/uuid:fa9894ee-740f-4ce3-9a61-f408b510687f



DOWNLOAD PDF




Related documents