liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Building tractable disjunctive constraints
University of London.
University of Oxford.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Technical Unversity of Crete.
2000 (English)In: Journal of the ACM, ISSN 0004-5411, Vol. 47, no 5, 826-853 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2000. Vol. 47, no 5, 826-853 p.
Keyword [en]
algorithms, theory, complexity, constraint satisfaction problem, disjunctive constraints, independence, NP-completeness, relations
National Category
Natural Sciences
URN: urn:nbn:se:liu:diva-49462DOI: 10.1145/355483.355485OAI: diva2:270358
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2010-01-22

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
In the same journal
Journal of the ACM
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 36 hits
ReferencesLink to record
Permanent link

Direct link