{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:40:45Z","timestamp":1730313645312,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,7,25]]},"DOI":"10.1145\/1277500.1277525","type":"proceedings-article","created":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T13:21:02Z","timestamp":1673184062000},"page":"170-179","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Approximate GCDs in Ill-conditioned Cases"],"prefix":"10.1145","author":[{"given":"Masaru","family":"Sanuki","sequence":"first","affiliation":[{"name":"University of Tsukuba, Tsukuba-Shi, Ibaraki, Japan"}]},{"given":"Tateaki","family":"Sasaki","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba-Shi, Ibaraki, Japan"}]}],"member":"320","published-online":{"date-parts":[[2007,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0235"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220371"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.837413"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(97)00013-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005311"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/271130.271136"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145799"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/147979.147987"},{"key":"e_1_3_2_1_9_1","first-page":"227","article-title":"A stable extended algorithm for generating polynomial remainder sequence (in Japanese). Trans. of JSIAM (Japan Society for Indus","volume":"7","author":"Ohsako H.","year":"1997","unstructured":"H. Ohsako , H. Sugiura and T. Torii . A stable extended algorithm for generating polynomial remainder sequence (in Japanese). Trans. of JSIAM (Japan Society for Indus . Appl. Math.) 7 ( 1997 ), 227 -- 255 . H. Ohsako, H. Sugiura and T. Torii. A stable extended algorithm for generating polynomial remainder sequence (in Japanese). Trans. of JSIAM (Japan Society for Indus. Appl. Math.) 7 (1997), 227--255.","journal-title":"Appl. Math.)"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384136"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277500.1277525"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(85)90026-3"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of SNC2005","author":"Sasaki T.","year":"2005","unstructured":"T. Sasaki and F. Kako . An algebraic method for separating close-root clusters and the minimum root separation . Proc. of SNC2005 , D. Wang & L. Zhi (Eds.) , 2005 , 126--143. T. Sasaki and F. Kako. An algebraic method for separating close-root clusters and the minimum root separation. Proc. of SNC2005, D. Wang & L. Zhi (Eds.), 2005, 126--143."},{"key":"e_1_3_2_1_14_1","unstructured":"T. Sasaki and F. Kako. Computing the floating-point Gr.obner bases stably. This proceedings. T. Sasaki and F. Kako. Computing the floating-point Gr.obner bases stably. This proceedings."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/70413.70420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80105-8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/271130.271131"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/281508.281521"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03167202"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005331"},{"key":"e_1_3_2_1_21_1","volume-title":"Preprint","author":"Zeng Z.","year":"2004","unstructured":"Z. Zeng . The approximate GCD of inexact polynomials part I: a univariate algorithm . Preprint , 2004 . Z. Zeng. The approximate GCD of inexact polynomials part I: a univariate algorithm. Preprint, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812704436_0024"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.875462"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812791962_0002"}],"event":{"name":"ISSAC07: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"London Ontario Canada","acronym":"ISSAC07"},"container-title":["Proceedings of the 2007 international workshop on Symbolic-numeric computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1277500.1277525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T13:23:21Z","timestamp":1673184201000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277500.1277525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,25]]},"references-count":24,"alternative-id":["10.1145\/1277500.1277525","10.1145\/1277500"],"URL":"https:\/\/doi.org\/10.1145\/1277500.1277525","relation":{},"subject":[],"published":{"date-parts":[[2007,7,25]]},"assertion":[{"value":"2007-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}