Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00085-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053566189 / rank | |||
Normal rank | |||
Revision as of 19:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting trees in a graph is \(\# \text{P}\)-complete |
scientific article |
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
