All reports by Author Andrei A. Bulatov:

__
TR07-093
| 27th July 2007
__

Andrei A. Bulatov#### The complexity of the counting constraint satisfaction problem

Revisions: 1

Andrei A. Bulatov

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 paper we characterize relational structures H for which

#CSP(H) can be solved in ...
more >>>