Constraint Satisfaction with Succinctly Specified Relations

Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations.

• Type: Conference
• Year: 2006
• Where: DAGSTUHL
• Authors: Hubie Chen, Martin Grohe
• Keywords: Constraint Relations, Constraint Satisfaction Problem, DAGSTUHL 2006, DAGSTUHL 2007, General Intractability