Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard

Computational complexity and feasibility of data processing and interval computations

Computers & Mathematics with Applications · 1998 · 365 citations

Computing, Computer Science, Mathematics +15

Computational complexity of μ calculation

Richard P. Braatz, Peter M. Young, John C. Doyle et al. · IEEE Transactions on Automatic Control · 1994 · 327 citations

Computing, Computer Science, Algorithms +12

Several NP-hard problems arising in robust stability analysis

Mathematics of Control Signals and Systems · 1993 · 265 citations

Natural Sciences, Computer Science, Mathematics +14

Checking robust nonsingularity is NP-hard

Svatopluk Poljak, Ji � Rohn · Mathematics of Control Signals and Systems · 1993 · 264 citations

Computing, Computer Science, Mathematics +6

The Componentwise Distance to the Nearest Singular Matrix

James Demmel · SIAM Journal on Matrix Analysis and Applications · 1992 · 94 citations

Computing, Computer Science, Mathematics +16