Solving Interval Linear Systems Is NP-Hard Even When All Inputs Are Known With the Same Accuracy

Authors

Ralph Kelsey, Ohio UniversityFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

7-18-2013

Comments

Technical Report: UTEP-CS-13-37

Abstract

It is known that in general, solving interval linear systems is NP-hard. There exist several proofs of this NP-hardness, and all these proofs use examples with intervals of different width -- corresponding to different accuracy in measuring different coefficients. For some classes of interval linear systems with the same accuracy, feasible algorithms are known. We show, however, that in general, solving interval linear systems is NP-hard even when all inputs are known with the same accuracy.