The complexity of counting homomorphisms seen from the other side
Authors:
- 1 December 2004
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 329 (1-3) , 315-323
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Conjunctive-Query Containment and Constraint SatisfactionJournal of Computer and System Sciences, 2000
- The complexity of counting graph homomorphismsRandom Structures & Algorithms, 2000
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- On the algebraic structure of combinatorial problemsTheoretical Computer Science, 1998
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- Complexity of Generalized Satisfiability Counting ProblemsInformation and Computation, 1996
- Quickly Excluding a Planar GraphJournal of Combinatorial Theory, Series B, 1994