About this paper

Characterizes when structural restrictions can make an otherwise hard constraint satisfaction problem tractable.

The hybrid setting restricts both the instance structure and the allowed constraint language. Lifted languages connect this setting to algebraic CSP methods, yielding characterizations for several families of structural restrictions.