📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

The complexity of counting homomorphisms to cactus graphs modulo 2 (2014)

First Author: Göbel A

Attributed to: Computational Counting funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/2635825

Publication URI: http://dx.doi.org/10.1145/2635825

Type: Journal Article/Review

Parent Publication: ACM Transactions on Computation Theory

Issue: 4