The complexity of approximately counting tree homomorphisms (Q2943573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of approximately counting tree homomorphisms |
scientific article; zbMATH DE number 6478365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of approximately counting tree homomorphisms |
scientific article; zbMATH DE number 6478365 |
Statements
The Complexity of Approximately Counting Tree Homomorphisms (English)
0 references
3 September 2015
0 references
complexity classes
0 references
counting problems
0 references
graph homomorphisms
0 references
reducibility
0 references
0 references
0 references
0.845281183719635
0 references
0.8446789383888245
0 references
0.8129603266716003
0 references
