The complexity of the counting constraint satisfaction problem
The complexity of the counting constraint satisfaction problem
复制标题
DOI：
10.1145/2528400
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
A. Bulatov
中科院分区：
文献类型：
--
作者：
A. Bulatov
有限关系结构H上的计数约束满足问题（#CSP(H)）可以表示如下：给定一个关系结构G在相同的词汇表上，确定从G到H的同态数。在本文中，我们刻画了可以在多项式时间内求解（#CSP(H)）的关系结构H，并证明了对于所有其他结构，问题是# p -完全的。
The Counting Constraint Satisfaction Problem (#CSP(H)) over a finite relational structure H can be expressed as follows: given a relational structure G over the same vocabulary, determine the number of homomorphisms from G to H. In this article we characterize relational structures H for which (#CSP(H) can be solved in polynomial time and prove that for all other structures the problem is #P-complete.