{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T21:12:50Z","timestamp":1782508370137,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01213466","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:35:45Z","timestamp":1109338545000},"page":"1-9","source":"Crossref","is-referenced-by-count":195,"title":["Checking robust nonsingularity is NP-hard"],"prefix":"10.1007","volume":"6","author":[{"given":"Svatopluk","family":"Poljak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ji?\ufffd","family":"Rohn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F. Barahona","year":"1986","unstructured":"F. Barahona, A solvable case of quadratic 0?1 programming,Discrete Appl. Math.,13 (1986), 24?36.","journal-title":"Discrete Appl. Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4064\/cm-23-1-165-171","volume":"23","author":"T. A. Brown","year":"1971","unstructured":"T. A. Brown and J. Spencer, Minimization of \ufffd1-matrices under line shifts,Colloq. Math. (Poland),23 (1971), 165?171.","journal-title":"Colloq. Math. (Poland)"},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82739-6","volume-title":"Sensitivity Analysis in Linear Systems","author":"A. Deif","year":"1986","unstructured":"A. Deif,Sensitivity Analysis in Linear Systems, Springer-Verlag, Berlin, 1986."},{"key":"CR4","unstructured":"Ch. Delorme and S. Poljak, Laplacian Eigenvalues and the Maximum Cut Problem, Technical Report 599, L.R.I., Universit\ufffd Paris-Sud, 1990."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M. Deza and M. Laurent, Facets for the cut cone, I,Math. Programming,56 (to appear).","DOI":"10.1007\/BF01580897"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1049\/ip-d.1982.0053","volume":"129","author":"J. C. Doyle","year":"1982","unstructured":"J. C. Doyle, Analysis of feedback systems with structured uncertainties,Proc. IEEE,129 (1982), 242?250.","journal-title":"Proc. IEEE"},{"key":"CR7","volume-title":"Probabilistic Methods in Combinatorics","author":"P. Erd\ufffds","year":"1974","unstructured":"P. Erd\ufffds and J. Spencer,Probabilistic Methods in Combinatorics, Akademiai Kiad\ufffd, Budapest, 1974."},{"key":"CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/322248.322260","volume":"28","author":"K. J. Lieberherr","year":"1981","unstructured":"K. J. Lieberherr and E. Specker, Complexity of partial satisfaction,J. Assoc. Comput. Mach.,28 (1981), 411?421.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"M. Mansour, Robust stability of interval matrices,Proceedings of the 28th Conference on Decision and Control, Tampa, FL, 1989, pp. 46?51.","DOI":"10.1109\/CDC.1989.70071"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.21136\/CMJ.1990.102386","volume":"115","author":"B. Mohar","year":"1990","unstructured":"B. Mohar and S. Poljak, Eigenvalues and the max-cut problem,Czech. Math. J.,115 (1990), 343?352.","journal-title":"Czech. Math. J."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1137\/0401037","volume":"1","author":"S. Poljak","year":"1988","unstructured":"S. Poljak, V. R\ufffddl, and J. Spencer, Tournament ranking with expected profit in polynomial time,SIAM J. Discrete Math.,1 (1988), 372?376.","journal-title":"SIAM J. Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(86)90192-5","volume":"58","author":"S. Poljak","year":"1986","unstructured":"S. Poljak and D. Turzik, A polynomial time heuristic for certain subgraph optimization problems with a guaranteed worst case bound,Discrete Math.,58 (1986), 99?104.","journal-title":"Discrete Math."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0024-3795(89)90004-9","volume":"126","author":"J. Rohn","year":"1989","unstructured":"J. Rohn, Systems of linear interval equations,Linear Algebra Appl.,126 (1989), 39?78.","journal-title":"Linear Algebra Appl."},{"key":"CR15","volume-title":"Theory of Integer and Linear Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Integer and Linear Programming, Wiley, Chichester, 1986."},{"key":"CR16","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"A. Tarski,A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, CA, 1951."}],"container-title":["Mathematics of Control, Signals, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213466.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01213466\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T18:04:11Z","timestamp":1625508251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01213466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01213466"],"URL":"https:\/\/doi.org\/10.1007\/bf01213466","relation":{},"ISSN":["0932-4194","1435-568X"],"issn-type":[{"value":"0932-4194","type":"print"},{"value":"1435-568X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}