Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Article title
Domain permutation reduction for constraint satisfaction problems
Type
D - Journal article
Title of journal
Artificial Intelligence
Article number
-
Volume number
172
Issue number
8-9
First page of article
1094
ISSN of journal
0004-3702
Year of publication
2008
Number of additional authors
1
Additional information
<11>This paper began a new area of research in the complexity of constraint problems in that it considers tractability for certain algorithms, rather than looking for likely properties of the instance. We investigate when certain algorithms remain tractable (identifiable and solvable in polynomial time ) even when the structure allowing them is hidden by domain renaming, which is likely in practice. Many subsequent papers have analysed the effectiveness of other CSP algorithms in a similar vein (Montreal, Warwick, Barcelona) following the approach we have introduced.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Centre for Algorithms and their Applications
Citation count
7
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
