The Counting Constraint Satisfaction Problem (#CSP(H)) over a finite relational structureH can be expressed as follows: given a relational structure G over the same vocabulary, determine the number of homomorphisms from G toH. In this paper we characterize relational structuresH for which#CSP(H) can be solved in polynomial time and prove that for all other structures the problem is #P-complete.
Motivated by Fagin’s characterization of NP, Saluja et al. have introduced a logic based framework f...
We give a complexity dichotomy theorem for the counting constraint satisfaction problem (#CSP in sho...
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, den...
The Counting Constraint Satisfaction Problem (#CSP(H)) over a nite relational structure H can be exp...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
AbstractThe Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
AbstractFor every class of relational structures C, let HOM(C,_) be the problem of deciding whether ...
AbstractThe Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set...
Homomorphisms between relational structures are not only fundamental mathematical objects, but are a...
Motivated by Fagin’s characterization of NP, Saluja et al. have introduced a logic based framework f...
We give a complexity dichotomy theorem for the counting constraint satisfaction problem (#CSP in sho...
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, den...
The Counting Constraint Satisfaction Problem (#CSP(H)) over a nite relational structure H can be exp...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the for...
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of vari...
AbstractThe Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
AbstractFor every class of relational structures C, let HOM(C,_) be the problem of deciding whether ...
AbstractThe Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set...
Homomorphisms between relational structures are not only fundamental mathematical objects, but are a...
Motivated by Fagin’s characterization of NP, Saluja et al. have introduced a logic based framework f...
We give a complexity dichotomy theorem for the counting constraint satisfaction problem (#CSP in sho...
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, den...
Add to ORKG