Thumbnail
Access Restriction
Subscribed

Author Cohen, David ♦ Jeavons, Peter ♦ Jonsson, Peter ♦ Koubarakis, Manolis
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword NP-completeness ♦ Complexity ♦ Constraint satisfaction problem ♦ Disjunctive constraints ♦ Independence ♦ Relations
Abstract Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more general, tractable classes. We give examples to show that many known examples of tractable constraint classes, from a wide variety of different contexts, can be constructed from simpler tractable classes using a general method. We also construct several new tractable classes that have not previously been identified.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 47
Issue Number 5
Page Count 28
Starting Page 826
Ending Page 853


Open content in new tab

   Open content in new tab
Source: ACM Digital Library