{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:44:37Z","timestamp":1755218677054,"version":"3.43.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1009998515856","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"39-53","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms That Still Produce a Solution (Maybe Not Optimal) Even When Interrupted: Shary's Idea Justified"],"prefix":"10.1007","volume":"4","author":[{"given":"Maria","family":"Beltran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Castillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"160699_CR1","unstructured":"Gaganov, A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, Leningrad University, Math. Department, M.S. Thesis, 1981 (in Russian)."},{"key":"160699_CR2","doi-asserted-by":"crossref","unstructured":"Gaganov, A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, Cybernetics (1985), pp. 418-421.","DOI":"10.1007\/BF01070595"},{"key":"160699_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"160699_CR4","first-page":"296","volume-title":"Scientific Computing and Validated Numerics","author":"V. Kreinovich","year":"1996","unstructured":"Kreinovich, V., Lakeyev, A., and Rohn, J.: Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable\u2014A Survey, in: Alefeld, G., Frommer, A., and Lang, B. (eds), Scientific Computing and Validated Numerics, Akademie-Verlag, Berlin, 1996, pp. 296-306."},{"issue":"3","key":"160699_CR5","first-page":"265","volume":"9","author":"L. A. Levin","year":"1973","unstructured":"Levin, L. A.: Universal Sequential Search Problems, Problems of Information Transmission\n9(3) (1973), pp. 265-266.","journal-title":"Problems of Information Transmission"},{"key":"160699_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1993","unstructured":"Li, M. and Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, N. Y., 1993."},{"issue":"4","key":"160699_CR7","first-page":"18","volume":"2","author":"S. P. Shary","year":"1992","unstructured":"Shary, S. P.: A New Class of Algorithms for Optimal Solution of Interval Linear Systems, Interval Computations 2(4) (1992), pp. 18-29.","journal-title":"Interval Computations"},{"key":"160699_CR8","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/0732027","volume":"32","author":"S. P. Shary","year":"1995","unstructured":"Shary, S. P.: On Optimal Solution of Interval Linear Equations, SIAM J. Numer. Anal.\n32 (1995), pp. 610-630.","journal-title":"SIAM J. Numer. Anal."},{"key":"160699_CR9","first-page":"314","volume-title":"Scientific Computing and Validated Numerics","author":"Y. I. Shokin","year":"1996","unstructured":"Shokin, Yu. I.: On Interval Problems, Interval Algorithms and Their Computational Complexity, in: Alefeld, G., Frommer, A., and Lang, B. (eds), Scientific Computing and Validated Numerics, Akademie-Verlag, Berlin, 1996, pp. 314-328."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009998515856.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009998515856\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009998515856.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:37:34Z","timestamp":1754473054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009998515856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["160699"],"URL":"https:\/\/doi.org\/10.1023\/a:1009998515856","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}