Tractable hypergraph properties for constraint satisfaction and conjunctive queries. (arXiv:0911.0801v1 [cs.DS])

An important question in the study of constraint satisfaction problems (CSP)is understanding how the graph or hypergraph describing the incidence structureof the constraints influences the complexity of the problem. For binary CSPinstances (i.e., where each constraint involves only two variables), » Full text »