Output details
11 - Computer Science and Informatics
University of Hertfordshire
Return to search
Output 0 of 0 in the submission
Article title
CD(4) has bounded width
Type
D - Journal article
Title of journal
Algebra Universalis
Article number
-
Volume number
60
Issue number
-
First page of article
293
ISSN of journal
0002-5240
Year of publication
2009
URL
-
Number of additional authors
3
Additional information
<10> This paper made a major advance on what was then known about which Constraint Satisfaction Problems (CSPs) have bounded width, that is, can be checked by local consistency check algorithms. This paper was a result of a collaboration with researchers in Barcelona (Spain), Novi Sad (Serbia) and Szeged (Hungary), and settled an important special case of what was then an open conjecture. The methods developed in this paper were later used by other researchers at the University of Prague (Czech Republic) to settle the general case of the bounded width conjecture for CSPs.
Interdisciplinary
Yes
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
