Constraint satisfaction with succinctly specified relations
作者：
Highlights：
•
摘要
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.
论文关键词：Constraint satisfaction,Complexity,Succinct representations,Decision diagrams
论文评审过程：Received 2 March 2007, Revised 11 April 2010, Available online 20 April 2010.
论文官网地址：https://doi.org/10.1016/j.jcss.2010.04.003
