{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:44:24Z","timestamp":1755218664224,"version":"3.43.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1023\/a:1021368627321","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T20:22:32Z","timestamp":1048191752000},"page":"481-491","source":"Crossref","is-referenced-by-count":5,"title":["Range Estimation Is NP-Hard for \u03b52 Accuracy and Feasible for \u03b52\u2212\u03b4"],"prefix":"10.1007","volume":"8","author":[{"given":"Vladik","family":"Kreinovich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5112316_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1009958918582","volume":"4","author":"M. Berz","year":"1998","unstructured":"Berz., M. and Hoffst\u00e4tter, G.: Computation and Application of Taylor Polynomials with Interval Remainder Bounds, Reliable Computing\n4 (1) (1998), pp. 83-97.","journal-title":"Reliable Computing"},{"key":"5112316_CR2","unstructured":"Gaganov. A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, M.S. thesis, Leningrad University, Math. Department, 1981 (in Russian)."},{"key":"5112316_CR3","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":"5112316_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. E. Garey","year":"1979","unstructured":"Garey, M. E. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"issue":"1","key":"5112316_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1009942430877","volume":"4","author":"R. Hungerb\u00fchler","year":"1998","unstructured":"Hungerb\u00fchler, R. and Garloff, J.: Bounds for the Range of a Bivariate Polynomial over a Triangle, Reliable Computing\n4 (1) (1998), pp. 3-13.","journal-title":"Reliable Computing"},{"key":"5112316_CR6","unstructured":"Kahl, P.: Solving Narrow-Interval Linear Equation Systems Is NP-Hard, M.S. thesis, University of Texas at El Paso, Department of Computer Science, 1996."},{"key":"5112316_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational Complexity and Feasibility of Data Processing and Interval Computations","author":"V. Kreinovich","year":"1998","unstructured":"Kreinovich, V., Lakeyev., A., Rohn, J., and Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations, Kluwer Academic Publishers, Dordrecht, 1998."},{"issue":"1","key":"5112316_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1026485406803","volume":"5","author":"K. Makino","year":"1999","unstructured":"Makino, K. and Berz, M.: Efficient Control of the Dependency Problem Based on Taylor Model Methods, Reliable Computing\n5 (1) (1999), pp. 3-12.","journal-title":"Reliable Computing"},{"key":"5112316_CR9","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H.: Computational Complexity, Addison Wesley, San Diego, 1994."},{"key":"5112316_CR10","volume-title":"Nonlinear Optimization: Complexity Issues","author":"S. A. Vavasis","year":"1991","unstructured":"Vavasis, S. A.: Nonlinear Optimization: Complexity Issues, Oxford University Press, N.Y., 1991."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021368627321.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021368627321\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021368627321.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:36:02Z","timestamp":1754472962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021368627321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5112316"],"URL":"https:\/\/doi.org\/10.1023\/a:1021368627321","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}