Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763)
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: Counting trees in a graph is \# P-complete |
scientific article; zbMATH DE number 633506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting trees in a graph is \(\# \text{P}\)-complete |
scientific article; zbMATH DE number 633506 |
Statements
Counting trees in a graph is \(\# \text{P}\)-complete (English)
0 references
13 October 1994
0 references
computational complexity
0 references
combinatorial enumeration
0 references
\#P-completeness
0 references
0.8977715969085693
0 references
0.8267402052879333
0 references
0.8256064653396606
0 references
0.8123448491096497
0 references
0.8088834881782532
0 references
