4 search results - page 1 / 1 » Enumerating Homomorphisms |
IJCM
2008
13 years 11 months ago
2008
We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial auto...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
ATAL
2010
Springer
14 years 4 hour ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...