{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:16Z","timestamp":1750306636339,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T00:00:00Z","timestamp":1390867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2014,1,28]]},"DOI":"10.1145\/2576802.2576818","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T14:16:21Z","timestamp":1391523381000},"page":"110-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Calculating approximate GCD of multiple univariate polynomials using approximate syzygies"],"prefix":"10.1145","volume":"47","author":[{"given":"Akira","family":"Terui","sequence":"first","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837967"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00014-6"},{"key":"e_1_2_1_3_1","series-title":"Lecture Notes in Computer Science 6244","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-642-15274-0_22","volume-title":"an iterative method for calculating approximate GCD, for multiple univariate polynomials","author":"Terui GPGCD","year":"2010","unstructured":"A. Terui . GPGCD , an iterative method for calculating approximate GCD, for multiple univariate polynomials . In Lecture Notes in Computer Science 6244 , pages 238 -- 249 . Springer , 2010 . A. Terui. GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials. In Lecture Notes in Computer Science 6244, pages 238--249. Springer, 2010."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.023"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576802.2576818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576802.2576818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:54Z","timestamp":1750229754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576802.2576818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,28]]},"references-count":4,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2014,1,28]]}},"alternative-id":["10.1145\/2576802.2576818"],"URL":"https:\/\/doi.org\/10.1145\/2576802.2576818","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2014,1,28]]},"assertion":[{"value":"2014-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}