Computing an Evolutionary Ordering is Hard
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
TL;DR
This paper proves that determining an evolutionary ordering of a family of sets, where each set intersects with previous sets but is not contained within their union, is an NP-hard problem, highlighting its computational difficulty.
Contribution
It establishes the NP-hardness of computing an evolutionary ordering of sets, a problem previously unclassified in complexity.
Findings
Proves NP-hardness of the evolutionary ordering problem.
Highlights computational challenges in set ordering tasks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptics and Image Analysis · Constraint Satisfaction and Optimization · semigroups and automata theory