Sökning: onr:"swepub:oai:DiVA.org:liu-49462" >
Building tractable ...
Building tractable disjunctive constraints
-
- Cohen, D (författare)
- University of London
-
- Jeavons, P (författare)
- University of Oxford
-
- Jonsson, Peter (författare)
- Linköpings universitet,TCSLAB - Laboratoriet för teoretisk datalogi,Tekniska högskolan
-
visa fler...
-
- Koubarakis, M (författare)
- Technical Unversity of Crete
-
visa färre...
-
(creator_code:org_t)
- 2000-09
- 2000
- Engelska.
-
Ingår i: Journal of the ACM. - : Association for Computing Machinery (ACM). - 0004-5411 .- 1557-735X. ; 47:5, s. 826-853
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Nyckelord
- algorithms
- theory
- complexity
- constraint satisfaction problem
- disjunctive constraints
- independence
- NP-completeness
- relations
- NATURAL SCIENCES
- NATURVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas