| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657683 | Theoretical Computer Science | 2005 | 39 Pages |
Abstract
In a nutshell, our result says that the problem is in polynomial time if the adjacency matrix of H has row rank 1, and #P-hard otherwise.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andrei Bulatov, Martin Grohe,