The real nonnegative inverse eigenvalue problem is NP-hard
Computational Complexity
2017-02-14 v2 Rings and Algebras
Abstract
A list of complex numbers is realizable if it is the spectrum of a nonnegative matrix. In 1949 Suleimanova posed the nonnegative inverse eigenvalue problem (NIEP): the problem of determining which lists of complex numbers are realizable. The version for reals of the NIEP (RNIEP) asks for realizable lists of real numbers. In the literature there are many sufficient conditions or criteria for lists of real numbers to be realizable. We will present an unified account of these criteria. Then we will see that the decision problem associated to the RNIEP is NP-hard and we will study the complexity for the decision problems associated to known criteria.
Cite
@article{arxiv.1608.00931,
title = {The real nonnegative inverse eigenvalue problem is NP-hard},
author = {Alberto Borobia and Roberto Canogar},
journal= {arXiv preprint arXiv:1608.00931},
year = {2017}
}
Comments
10 pages, 1 figure