Counting trees in a graph is \(\# \text{P}\)-complete
type: Item
instance of: scholarly article
title: Counting trees in a graph is \(\# \text{P}\)-complete
zbMATH Open document ID: 0809.68076
DOI: 10.1016/0020-0190(94)00085-9
published in: Information Processing Letters
publication date: 1994-10-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 633506
zbMATH Keywords: computational complexity
zbMATH Keywords: combinatorial enumeration
zbMATH Keywords: \#P-completeness
Wikidata QID: Q56083439
author: Mark Jerrum
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00085-9
OpenAlex ID: W2053566189
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Q4198056
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 633506