📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

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