Computing an Evolutionary Ordering is Hard
classification
💻 cs.CC
keywords
orderingcomputingevolutionarysetsearlierfamilyhardin--
read the original abstract
We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.