On Backdoors to Tractable Constraint Languages

CP, pp. 224-239, 2014.

Cited by: 9|Views5
EI

Abstract:

In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important c...More

Code:

Data:

Your rating :
0

 

Tags
Comments