Understanding Tractable Decompositions for Constraint Satisfaction
Constraint satisfaction problems (CSPs) are NP-complete in general, therefore it is important to identify tractable subclasses. A possible way to find such subclasses is to associate a hypergraph to the problem and impose restrictions on its structure. In this thesis we follow this direction. Among...
| Main Author: | |
|---|---|
| Published: |
University of Oxford
2008
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491400 |