Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Enumeration and Reliability Problems / rank | |||
Normal rank | |||
Latest revision as of 16:37, 22 May 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
