Pages that link to "Item:Q3224696"
From MaRDI portal
The following pages link to The Complexity of Rooted Phylogeny Problems (Q3224696):
Displaying 7 items.
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- The Complexity of Phylogeny Constraint Satisfaction (Q4601872) (← links)
- The Complexity of Phylogeny Constraint Satisfaction Problems (Q5369246) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)