The Complexity of Approximately Counting Tree Homomorphisms (2014)
Attributed to:
Computational Counting
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1145/2600917
Publication URI: http://dx.doi.org/10.1145/2600917
Type: Journal Article/Review
Parent Publication: ACM Transactions on Computation Theory
Issue: 2