Computing an Evolutionary Ordering is Hard

Name: Computing an Evolutionary Ordering is Hard
Author: Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri

Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri

paper2014-10-24English

Start Reading

computational financearxiv

Description

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.

Similar Books

paper

Quantitative mode stability for the wave equation on the Kerr-Newman spacetime

Damon Civin

Quantitative mode stability for the wave equation on the Kerr-Newman spacetime

paper

Risk-Aware Objective-Based Forecasting in Inertia Management

Haipeng Zhang, Ran Li, Yan Chen, Zhongda Chu, Mingyang Sun

Risk-Aware Objective-Based Forecasting in Inertia Management

paper

Chainalysis: Geography of Cryptocurrency 2023

Chainalysis

Chainalysis: Geography of Cryptocurrency 2023

paper

Periodicity in Cryptocurrency Volatility and Liquidity

Peter Reinhard Hansen, Chan Kim, Wade Kimbrough

Periodicity in Cryptocurrency Volatility and Liquidity

paper

Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain

Saeideh Sekhavat, Mostafa Jamshidian, Adam Wittek, Karol Miller

Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain

paper

Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I

Getachew K. Befekadu

Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I