During the recent years, a number of linear problems with interval data have been proved to be NP-hard. These results may seem rather obscure as regards the ways in which they were obtained. This survey paper is aimed at demonstrating that in fact it is not so, since many of these results follow easily from the recently established fact that for the subordinate matrix norm ‖ · ‖∞,1 it is NP-hard to decide whether ‖A‖∞,1 ≥ 1 holds, even in the class of symmetric positive definite rational matrices. After a brief introduction into the basic topics of the complexity theory in Section 1 and formulation of the underlying norm complexity result in Section 2, we present NP-hardness results for checking properties of interval matrices (Section 3), computing enclosures (Section 4), solvability of rectangular linear interval systems (Section 5), and linear and quadratic programming (Section 6). Due to space limitations, proofs are mostly only ketched to reveal the unifying role of the norm complexity result; technical details are omitted.
Reliable Computing – Springer Journals
Published: Oct 14, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud