Checking robust nonsingularity is NP-hard
- 1 March 1993
- journal article
- research article
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- Vol. 6 (1), 1-9
- https://doi.org/10.1007/bf01213466
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Robust stability of interval matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- Facets for the cut cone IMathematical Programming, 1992
- Systems of linear interval equationsLinear Algebra and its Applications, 1989
- Tournament Ranking with Expected Profit in Polynomial TimeSIAM Journal on Discrete Mathematics, 1988
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case boundDiscrete Mathematics, 1986
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Analysis of feedback systems with structured uncertaintiesIEE Proceedings D Control Theory and Applications, 1982
- Complexity of Partial SatisfactionJournal of the ACM, 1981
- Minimization of ±1 matrices under line shiftsColloquium Mathematicum, 1971