Pages that link to "Item:Q5369246"
From MaRDI portal
The following pages link to The Complexity of Phylogeny Constraint Satisfaction Problems (Q5369246):
Displaying 15 items.
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Approximation algorithms for the fixed-topology phylogenetic number problem (Q1125454) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- On a stronger reconstruction notion for monoids and clones (Q2121508) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- The Complexity of Phylogeny Constraint Satisfaction (Q4601872) (← links)
- (Q5089260) (← links)
- (Q5094139) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- Constructing Camin-Sokal Phylogenies Via Answer Set Programming (Q5387911) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)