{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:39:38Z","timestamp":1762324778518,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T00:00:00Z","timestamp":1595203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19K11827"],"award-info":[{"award-number":["19K11827"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,20]]},"DOI":"10.1145\/3373207.3403991","type":"proceedings-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T14:07:23Z","timestamp":1595858843000},"page":"372-379","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate GCD by bernstein basis, and its applications"],"prefix":"10.1145","author":[{"given":"Kosaku","family":"Nagasaka","sequence":"first","affiliation":[{"name":"Kobe University, Hyogo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/140998081"},{"volume-title":"Structured matrix based methods for approximate polynomial GCD. Tesi. Scuola Normale Superiore di Pisa (Nuova Series) [Theses of Scuola Normale Superiore di Pisa (New Series)]","author":"Boito Paola","key":"e_1_3_2_1_2_1","unstructured":"Paola Boito . 2011. Structured matrix based methods for approximate polynomial GCD. Tesi. Scuola Normale Superiore di Pisa (Nuova Series) [Theses of Scuola Normale Superiore di Pisa (New Series)] , Vol. 15 . Edizioni della Normale, Pisa . xvi+199 pages. Paola Boito. 2011. Structured matrix based methods for approximate polynomial GCD. Tesi. Scuola Normale Superiore di Pisa (Nuova Series) [Theses of Scuola Normale Superiore di Pisa (New Series)], Vol. 15. Edizioni della Normale, Pisa. xvi+199 pages."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377006.3377011"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/110853236"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1014001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2012.06.022"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009906513972"},{"key":"e_1_3_2_1_9_1","volume-title":"Computer Mathematics. ASCM","author":"Minimair Manfred","year":"2007","unstructured":"Manfred Minimair . 2008. Basis-independent polynomial division algorithm applied to division in Lagrange and Bernstein basis . In Computer Mathematics. ASCM 2007 . Lecture Notes in Comput. Sci., Vol. 5081 . Springer , Berlin, 72--86. Manfred Minimair. 2008. Basis-independent polynomial division algorithm applied to division in Lagrange and Bernstein basis. In Computer Mathematics. ASCM 2007. Lecture Notes in Comput. Sci., Vol. 5081. Springer, Berlin, 72--86."},{"key":"e_1_3_2_1_10_1","volume-title":"Toward the best algorithm for approximate GCD of univariate polynomials. J. Symbolic Comput. (2020). Special issue on MICA","author":"Nagasaka Kosaku","year":"2016","unstructured":"Kosaku Nagasaka . 2020. Toward the best algorithm for approximate GCD of univariate polynomials. J. Symbolic Comput. (2020). Special issue on MICA 2016 . (in press). Kosaku Nagasaka. 2020. Toward the best algorithm for approximate GCD of univariate polynomials. J. Symbolic Comput. (2020). Special issue on MICA 2016. (in press)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1106122"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3032"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1963.1105517"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11766-998-0056-9"},{"key":"e_1_3_2_1_15_1","volume-title":"Goldman","author":"Winkler Joab R.","year":"2003","unstructured":"Joab R. Winkler and Ronald N . Goldman . 2003 . The Sylvester resultant matrix for Bernstein polynomials. In Curve and surface design (Saint-Malo, 2002). Nashboro Press , Brentwood, TN, 407--416. Joab R. Winkler and Ronald N. Goldman. 2003. The Sylvester resultant matrix for Bernstein polynomials. In Curve and surface design (Saint-Malo, 2002). Nashboro Press, Brentwood, TN, 407--416."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2013.01.003"},{"key":"e_1_3_2_1_18_1","volume-title":"Contemp. Math.","volume":"556","author":"Zeng Zhonggang","year":"2011","unstructured":"Zhonggang Zeng . 2011 . The numerical greatest common divisor of univariate polynomials. In Randomization, relaxation, and complexity in polynomial equation solving . Contemp. Math. , Vol. 556 . Amer. Math. Soc., Providence, RI, 187--217. Zhonggang Zeng. 2011. The numerical greatest common divisor of univariate polynomials. In Randomization, relaxation, and complexity in polynomial equation solving. Contemp. Math., Vol. 556. Amer. Math. Soc., Providence, RI, 187--217."}],"event":{"name":"ISSAC '20: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kalamata Greece","acronym":"ISSAC '20"},"container-title":["Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3403991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373207.3403991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:45Z","timestamp":1750203885000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3403991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,20]]},"references-count":17,"alternative-id":["10.1145\/3373207.3403991","10.1145\/3373207"],"URL":"https:\/\/doi.org\/10.1145\/3373207.3403991","relation":{},"subject":[],"published":{"date-parts":[[2020,7,20]]},"assertion":[{"value":"2020-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}