{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:00:17Z","timestamp":1730314817224,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,28]]},"DOI":"10.1145\/1576702.1576750","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"351-358","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["An iterative method for calculating approximate GCD of univariate polynomials"],"prefix":"10.1145","author":[{"given":"Akira","family":"Terui","sequence":"first","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]}],"member":"320","published-online":{"date-parts":[[2009,7,28]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1006\/jsco.1998.0235"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/281508.281622"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/220346.220371"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/TSP.2004.837413"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied numerical linear algebra","author":"Demmel J. W.","year":"1997","unstructured":"J. W. Demmel . Applied numerical linear algebra . SIAM , 1997 . J. W. Demmel. Applied numerical linear algebra. SIAM, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/S0022-4049(97)00013-3"},{"volume-title":"Private communication","year":"2009","author":"Kaltofen E.","unstructured":"E. Kaltofen . Private communication . 2009 . E. Kaltofen. Private communication. 2009.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1145768.1145799"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-7643-7984-1_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1006\/jsco.1998.0232"},{"volume-title":"Numerical optimization","year":"2006","author":"Nocedal J.","unstructured":"J. Nocedal and S. J. Wright . Numerical optimization . Springer , New York , second edition, 2006 . J. Nocedal and S. J. Wright. Numerical optimization. Springer, New York, second edition, 2006.","key":"e_1_3_2_1_11_1"},{"issue":"3","key":"e_1_3_2_1_12_1","first-page":"227","article-title":"A stable extended algorithm for generating polynomial remainder sequence (in Japanese)","volume":"7","author":"Ohsako N.","year":"1997","unstructured":"N. Ohsako , H. Sugiura , and T. Torii . A stable extended algorithm for generating polynomial remainder sequence (in Japanese) . Trans. Japan Soc. Indus. Appl. Math , 7 ( 3 ): 227 -- 255 , 1997 . N. Ohsako, H. Sugiura, and T. Torii. A stable extended algorithm for generating polynomial remainder sequence (in Japanese). Trans. Japan Soc. Indus. Appl. Math, 7(3):227--255, 1997.","journal-title":"Trans. Japan Soc. Indus. Appl. Math"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1006\/inco.2001.3032"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1137\/0109044"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1277500.1277525"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/70413.70420"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/0885-064X(85)90024-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/BF00934495"},{"volume-title":"An iterative method for computing approximate GCD of univariate polynomials. preprint. 9 pages","year":"2009","author":"Terui A.","unstructured":"A. Terui . An iterative method for computing approximate GCD of univariate polynomials. preprint. 9 pages . 2009 . A. Terui. An iterative method for computing approximate GCD of univariate polynomials. preprint. 9 pages. 2009.","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/78.875462"},{"unstructured":"Z. Zeng. The approximate GCD of inexact polynomials Part I: a univariate algorithm (extended abstract). preprint. 8 pages. Z. Zeng. The approximate GCD of inexact polynomials Part I: a univariate algorithm (extended abstract). preprint. 8 pages.","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1142\/9789812704436_0024"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC '09","name":"ISSAC '09: International Symposium on Symbolic and Algebraic Computation","location":"Seoul Republic of Korea"},"container-title":["Proceedings of the 2009 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1576702.1576750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T19:39:52Z","timestamp":1673465992000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1576702.1576750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"references-count":22,"alternative-id":["10.1145\/1576702.1576750","10.1145\/1576702"],"URL":"https:\/\/doi.org\/10.1145\/1576702.1576750","relation":{},"subject":[],"published":{"date-parts":[[2009,7,28]]},"assertion":[{"value":"2009-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}