Pages that link to "Item:Q4504966"
From MaRDI portal
The following pages link to Counting Unlabelled Subtrees of a Tree is #P-complete (Q4504966):
Displaying 7 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
- Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Counting unlabeled \(k\)-trees (Q2452429) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)