Checking positive definiteness or stability of symmetric interval matrices is NP-hard

Jiří Rohn
Commentationes Mathematicae Universitatis Carolinae 35 ( 4) 795 -797

36
1994
1
2007
DUALITY IN INTERVAL LINEAR PROGRAMMING

Jiří Rohn
Interval Mathematics 1980 521 -529

16
1980
Computing the norm ∥A∥∞,1 is NP-hard ∗

Jiří Rohn
Linear & Multilinear Algebra 47 ( 3) 195 -204

34
2000
Interval linear systems with prescribed column sums

Jiří Rohn
Linear Algebra and its Applications 39 143 -148

10
1981
29
1996
On Overestimations Produced by the Interval Gaussian Algorithm

Jiří Rohn
Reliable Computing 3 363 -368

12
1997
On the Applicability of the Interval Gaussian Algorithm

Günter Mayer , Jiří Rohn
Reliable Computing 4 ( 3) 205 -222

17
1998
Complexity of Some Linear Problems with Interval Data

Jiří Rohn
Reliable Computing 3 ( 3) 315 -323

15
1997
How Strong Is Strong Regularity

Jiří Rohn
Reliable Computing 11 ( 6) 491 -493

1
2005
Regularity of Interval Matrices and Theorems of the Alternatives

Jiří Rohn
Reliable Computing 12 ( 2) 99 -105

6
2006
Radii of solvability and unsolvability of linear systems

Milan Hladík , Jiří Rohn
Linear Algebra and its Applications 503 120 -134

6
2016
Checking bounds on solutions of linear interval equations is NP-hard

Jiří Rohn
Linear Algebra and its Applications 589 -596

7
1995
Overestimations in bounding solutions of perturbed linear equations

Jiří Rohn
Linear Algebra and its Applications 262 55 -65

10
1997
Interval P -matrices

Jiří Rohn , Georg Rex
SIAM Journal on Matrix Analysis and Applications 17 ( 4) 1020 -1024

22
1996
Interval Linear Systems: Search for Feasible Classes

Vladik Kreinovich , Anatoly Lakeyev , Jiří Rohn , Patrick Kahl
Computational Complexity and Feasibility of Data Processing and Interval Computations 111 -142

1998
For Fractionally-Linear Functions, a Feasible Algorithm Solves the Basic Problem of Interval Computations

Vladik Kreinovich , Anatoly Lakeyev , Jiří Rohn , Patrick Kahl
Computational Complexity and Feasibility of Data Processing and Interval Computations 91 -98

1998
Engineering Corollary: Signal Processing is NP-Hard

Vladik Kreinovich , Anatoly Lakeyev , Jiří Rohn , Patrick Kahl
Computational Complexity and Feasibility of Data Processing and Interval Computations 153 -158

1998