{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:27Z","timestamp":1760061507669},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/s0747-7171(08)80105-8","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T05:59:32Z","timestamp":1214373572000},"page":"395-411","source":"Crossref","is-referenced-by-count":19,"title":["Three new algorithms for multivariate polynomial GCD"],"prefix":"10.1016","volume":"13","author":[{"given":"Tateaki","family":"Sasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80105-8_bib1","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","article-title":"On Euclid's algorithm and the computation of polynomial greatest common divisor","volume":"18","author":"Brown","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(08)80105-8_bib2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/355791.355795","article-title":"The subresultant PRS algorithm","volume":"4","author":"Brown","year":"1978","journal-title":"ACM Trans. Math. Soft."},{"key":"10.1016\/S0747-7171(08)80105-8_bib3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","article-title":"On Euclid's algorithm and the theory of subresultants","volume":"18","author":"Brown","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(08)80105-8_bib4","series-title":"Multidimensional Systems Theory","article-title":"Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1985"},{"key":"10.1016\/S0747-7171(08)80105-8_bib5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0032851","article-title":"GCDHEU: heuristic polynomial GCD algorithm based on integer GCD computation","volume":"174","author":"Char","year":"1984","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(08)80105-8_bib6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","article-title":"Subresultants and reduced polynomial remainder sequences","volume":"14","author":"Collins","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(08)80105-8_bib7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-15984-3_299","article-title":"GCDs and factoring multivariate polynomials using Gr\u00f6bner bases","volume":"204","author":"Gianni","year":"1985","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(08)80105-8_bib8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-09519-5_74","article-title":"Non-modular computation of polynomial GCDs using trial division","volume":"72","author":"Hearn","year":"1979","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(08)80105-8_bib9","series-title":"REDUCE User's Manual, version 3.2","author":"Hearn","year":"1985"},{"key":"10.1016\/S0747-7171(08)80105-8_bib10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/800192.805698","article-title":"The EZ GCD algorithm","author":"Moses","year":"1973","journal-title":"Proceedings of ACM'73"},{"key":"10.1016\/S0747-7171(08)80105-8_bib11","article-title":"Extended Euclidean Algorithm and Determinants","author":"Sasaki","year":"1982","journal-title":"Preprint of ICPR"},{"key":"10.1016\/S0747-7171(08)80105-8_bib12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-51517-8_138","article-title":"Some algebraic algorithms based on head term elimination over polynomial rings","volume":"378","author":"Sasaki","year":"1989","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(08)80105-8_bib13","article-title":"Improvements of PC-PRS GCD algorithm","author":"Suzuki","year":"1990","journal-title":"Preprint of IPCR"},{"key":"10.1016\/S0747-7171(08)80105-8_bib14","first-page":"50","article-title":"The EEZ-GCD algorithm. SICSAM","volume":"14","author":"Wang","year":"1980","journal-title":"Bulletin"},{"key":"10.1016\/S0747-7171(08)80105-8_bib15","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","article-title":"Probabilistic algorithms for sparse polynomials","volume":"72","author":"Zippel","year":"1979","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T11:57:06Z","timestamp":1545911826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108801058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["S0747717108801058"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80105-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}