{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:05Z","timestamp":1751282825901,"version":"3.32.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Control Signal Systems"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01211520","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:53:14Z","timestamp":1109361194000},"page":"279-291","source":"Crossref","is-referenced-by-count":25,"title":["The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix"],"prefix":"10.1007","volume":"7","author":[{"given":"Gregory E.","family":"Coxson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher L.","family":"DeMarco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems,Proceedings of the 33rd Annual IEEE Conference on Foundations of Computer Science, Pittsburgh, PA, October, 1992, pp. 14?23.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/9.284879","volume":"39","author":"R. Braatz","year":"1994","unstructured":"R. Braatz, P. Young, J. Doyle, and M. Morari, Computational complexity of mu calculation,IEEE Transactions on Automatic Control,39 (1994), 1000?1002.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"CR3","unstructured":"G. Coxson and C. DeMarco, Computing the real structured singular value is NP-hard, Report ECE-92-4, Department of Electrical and Computer Engineering, University of Wisconsin-Madison, June, 1992."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0613003","volume":"13","author":"J. Demmel","year":"1992","unstructured":"J. Demmel, The componentwise distance to the nearest singular matrix,SI AM Journal of Matrix Analysis and Applications, 13 (1992), 10?19.","journal-title":"SI AM Journal of Matrix Analysis and Applications"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1049\/ip-d.1982.0053","volume":"129","author":"J. Doyle","year":"1982","unstructured":"J. Doyle, Analysis of feedback systems with structured uncertainty,IEE Proceedings, D,129 (1982), 242?250.","journal-title":"IEE Proceedings, D"},{"key":"CR6","series-title":"SIAM-AMS Proceedings, vol. 7","volume-title":"Complexity of Computation","author":"R. Fagin","year":"1974","unstructured":"R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in Complexity of Computation, SIAM-AMS Proceedings, vol. 7, American Mathematical Society, Providence, RI, 1974."},{"key":"CR7","unstructured":"F. Gantmacher,The Theory of Matrices, Chelsea, New York, 1959."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems,Theoretical Computer Science,1 (1976), 237?267.","journal-title":"Theoretical Computer Science"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"M. Goemans, and D. Williamson,. 878-approximation algorithms for MAX CUT and MAX 2SAT,Proceedings of the 26th ACM Symposium on the Theory of Computing, New York, pp. 422?431.","DOI":"10.1145\/195058.195216"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01211741","volume":"6","author":"A. Nemirovskii","year":"1993","unstructured":"A. Nemirovskii, Several NP-hard problems arising in robust stability analysis,Mathematics of Control, Signals, and Systems,6 (1993), 99?106.","journal-title":"Mathematics of Control, Signals, and Systems"},{"key":"CR11","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"A. Neumaier,Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, and M. Yannakakis, Optimization, approximation and complexity classes,Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 229?234.","DOI":"10.1145\/62212.62233"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01213466","volume":"6","author":"S. Poljak","year":"1993","unstructured":"S. Poljak and J. Rohn, Checking robust nonsingularity is NP-hard,Mathematics of Control, Signals, and Systems,6 (1993), 1?9.","journal-title":"Mathematics of Control, Signals, and Systems"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"M. Safonov, Stability margins of diagonally perturbed multivariable feedback systems,Proceedings of the 20th IEEE Conference on Decision and Control, San Diego, CA, December, 1981, pp. 1472?1478.","DOI":"10.1109\/CDC.1981.269503"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"L. Saydy, A. Tits, and E. Abed, Robust stability of linear systems relative to guarded domains,Proceedings of the 27th IEEE Conference on Decision and Control, Austin, TX, December, 1988, pp. 544?551.","DOI":"10.1109\/CDC.1988.194370"},{"key":"CR16","unstructured":"P. Young, M. Newlin, and J. Doyle, Let's get real, presented at the SIAM Conference on Control and Its Applications, Minneapolis, MN, Sept. 1992."}],"container-title":["Mathematics of Control, Signals, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211520.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211520\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T01:24:48Z","timestamp":1735003488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01211520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01211520"],"URL":"https:\/\/doi.org\/10.1007\/bf01211520","relation":{},"ISSN":["0932-4194","1435-568X"],"issn-type":[{"type":"print","value":"0932-4194"},{"type":"electronic","value":"1435-568X"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}