Computing an Evolutionary Ordering is Hard
Computational Complexity
2014-10-27 v1
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.
Cite
@article{arxiv.1410.6663,
title = {Computing an Evolutionary Ordering is Hard},
author = {Laurent Bulteau and Gustavo Sacomoto and Blerina Sinaimeri},
journal= {arXiv preprint arXiv:1410.6663},
year = {2014}
}
Related papers
View all related →
Computational Complexity · Computer Science
Computational Complexity of Arranging Music
William S. Moses, Erik D. Demaine
2016-07-15
Computational Complexity · Computer Science
On the Complexity of Some Variations of Sorting by Transpositions
Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias
2022-02-18
Neural and Evolutionary Computing · Computer Science
Computational Complexity Results for Genetic Programming and the Sorting Problem
Markus Wagner, Frank Neumann
2011-05-09
Cryptography and Security · Computer Science
Evolutionary Computation Algorithms for Cryptanalysis: A Study
Poonam Garg
2010-07-01
Neural and Evolutionary Computing · Computer Science
Evolutionary solving of the debts' clearing problem
Csaba Patcas, Attila Bartha
2014-02-27
Data Structures and Algorithms · Computer Science
Sorting Algorithms with Restrictions
Hakob Aslanyan
2011-07-22
Networking and Internet Architecture · Computer Science
Maximizing the Cohesion is NP-hard
Adrien Friggeri, Eric Fleury
2011-10-11
Data Structures and Algorithms · Computer Science
Sorting by Transpositions is Difficult
Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012-09-05
Artificial Intelligence · Computer Science
A note on the complexity of the causal ordering problem
Bernardo Gonçalves, Fabio Porto
2016-07-26
Neural and Evolutionary Computing · Computer Science
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm
Boris Mitavskiy, Jun He
2014-04-23
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13
Rings and Algebras · Mathematics
The complexity of root-finding in orders
Pim Spelier
2025-07-01
Neural and Evolutionary Computing · Computer Science
Distribution of the search of evolutionary product unit neural networks for classification
A. J. Tallón-Ballesteros, P. A. Gutiérrez-Peña, C. Hervás-Martínez
2012-05-16
Neural and Evolutionary Computing · Computer Science
Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics
Greg Durrett, Frank Neumann, Una-May O'Reilly
2010-11-16
Neural and Evolutionary Computing · Computer Science
Are complex systems hard to evolve?
Andy Adamatzky, Larry Bull
2010-11-23
Neural and Evolutionary Computing · Computer Science
Evolutionary Optimization in an Algorithmic Setting
Mark Burgin, Eugene Eberbach
2007-05-23
Computational Complexity · Computer Science
Symmetry and Uncountability of Computation
Koji Kobayashi
2010-09-24
Software Engineering · Computer Science
Beyond Evolutionary Algorithms for Search-based Software Engineering
Jianfeng Chen, Vivek Nair, Tim Menzies
2017-09-19
Computational Complexity · Computer Science
On Computational Aspects of Ordered Matching Problems
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil, Paweł Rzążewski
2025-12-01
Artificial Intelligence · Computer Science
Evolutionary Turing in the Context of Evolutionary Machines
Mark Burgin, Eugene Eberbach
2013-04-16
Computational Complexity · Computer Science
The Problem of Computational Complexity
Rami Zaidan
2023-12-25
Populations and Evolution · Quantitative Biology
A Wild Sheep Chase Through an Orchard
Jordan Dempsey, Leo van Iersel, Mark Jones, Yukihiro Murakami +1
2024-09-24
Artificial Intelligence · Computer Science
Evolutionary Computing
Aguston E. Eiben, Marc Schoenauer
2007-05-23
Computational Geometry · Computer Science
Counting Polygon Triangulations is Hard
David Eppstein
2020-12-07
Neural and Evolutionary Computing · Computer Science
Calculating lexicase selection probabilities is NP-Hard
Emily Dolson
2023-04-25