On Backdoors to Tractable Constraint Languages
CP, pp. 224-239, 2014.
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
PPT (Upload PPT)