Detecting and exploiting subproblem tractability
IJCAI, pp. 468-474, 2013.
Constraint satisfaction problems may be nearly tractable. For instance, most of the relations in a problem might belong to a tractable language. We introduce a method to take advantage of this fact by computing a backdoor to this tractable language. The method can be applied to many tractable classes for which the membership test is itsel...More
PPT (Upload PPT)