{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:41Z","timestamp":1742912621308,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405542"},{"type":"electronic","value":"9783540450849"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45084-x_10","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:05:12Z","timestamp":1183478712000},"page":"225-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resultants and Neighborhoods of a Polynomial"],"prefix":"10.1007","author":[{"given":"Valentina","family":"Marotta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0045-7949(97)00150-8","volume":"67","author":"G. Alefeld","year":"1998","unstructured":"Alefeld, G., Claudio, D. (1998): The basic properties of interval arithmetic, its software realization and some applications. Computer and Structures, 67, 3\u20138","journal-title":"Computer and Structures"},{"key":"10_CR2","first-page":"261","volume-title":"Encyclopedia of Computer Science and Technology","author":"I. Z. Emiris","year":"1998","unstructured":"Emiris, I. Z. (1998): Symbolic-numeric algebra for polynomials. In: Encyclopedia of Computer Science and Technology, A. Kent and J.G. Williams, editors, vol. 39, 261\u2013281, Marcel Dekker, New York"},{"key":"10_CR3","volume-title":"Maple 6, Programming Guide","author":"K.O. Geddes","year":"2000","unstructured":"Geddes, K.O., Monogan, M.B., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, S. (2000): Maple 6, Programming Guide. Waterloo Maple Inc., Canada"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Hitz, M.A., Kaltofen, E. (1998): Efficient algorithms for computing the nearest polynomial with constrained root. In: Proceed. ISSAC\u201998 (Ed. O. Gloor), 236\u2013243","DOI":"10.1145\/281508.281624"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Hitz, M.A., Kaltofen, E. (1999): Efficient algorithms for computing the nearest polynomial with a real root and related problems. In: Proceed. ISSAC\u201999 (Ed. S. Dooley), 205\u2013212","DOI":"10.1145\/309831.309937"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Lakshman, Y.N. (1996): Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceed. ISSAC\u201996, 35\u201339","DOI":"10.1145\/236869.236892"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.2307\/2689124","volume":"42","author":"M.A. Laidacker","year":"1969","unstructured":"Laidacker, M.A. (1969): Another theorem relating Sylvester\u2019s matrix and the greatest common divisors. Mathematics Magazine 42, 126\u2013128","journal-title":"Mathematics Magazine"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1006\/aama.1996.0013","volume":"17","author":"R. Jia","year":"1996","unstructured":"Jia, R. (1996): Perturbation of polynomial ideals. Advances in Applied Mathematics 17, 308\u2013336","journal-title":"Advances in Applied Mathematics"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Stetter, H.J. (1999): Polynomial with coefficients of limited accuracy. In: Computer Algebra in Scientific Computing (Eds. V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov), Springer, 409\u2013430","DOI":"10.1007\/978-3-642-60218-4_32"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/500457.500458","volume":"33","author":"H.J. Stetter","year":"1999","unstructured":"Stetter, H.J. (1999): Nearest polynomial with a given zero, and similar problems. SIGSAM Bull. 33 n. 4, 2\u20134","journal-title":"SIGSAM Bull."},{"key":"10_CR11","first-page":"22","volume-title":"ATCM 2000, Proceed. 5th Asian Technology Conf. in Math.","author":"H.J. Stetter","year":"2000","unstructured":"Stetter, H.J. (2000): Numerical polynomial algebra: concepts and algorithms. In: ATCM 2000, Proceed. 5th Asian Technology Conf. in Math. (Eds.: W.-Ch. Yang, S.-Ch. Chu, J.-Ch. Chuan), 22\u201336, ATCM Inc. USA"},{"key":"10_CR12","unstructured":"Wolfram, S. (1999): The Mathematica Book. 4th ed., Wolfram Media, Cambridge University Press"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Numerical Scientific Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45084-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:58:46Z","timestamp":1676685526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45084-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405542","9783540450849"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45084-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"24 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}