The P-matrix problem is co-NP-complete
- 1 March 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1-3), 173-178
- https://doi.org/10.1007/bf01582570
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- The Componentwise Distance to the Nearest Singular MatrixSIAM Journal on Matrix Analysis and Applications, 1992
- Systems of linear interval equationsLinear Algebra and its Applications, 1989
- On matrices with non-positive off-diagonal elements and positive principal minorsCzechoslovak Mathematical Journal, 1962