The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Hi-index | 0.00 |