{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:48:51Z","timestamp":1743115731034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99639-4_24","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"345-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Theory and an Algorithm for\u00a0Computing Sparse Multivariate Polynomial Remainder Sequence"],"prefix":"10.1007","author":[{"given":"Tateaki","family":"Sasaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1145\/321662.321664","volume":"18","author":"WS Brown","year":"1971","unstructured":"Brown, W.S.: On Euclid\u2019s algorithm and the computation of polynomial greatest common divisors. JACM 18(4), 478\u2013504 (1971)","journal-title":"JACM"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"WS Brown","year":"1971","unstructured":"Brown, W.S., Traub, J.F.: On Euclid\u2019s algorithm and the theory of subresultants. JACM 18(4), 505\u2013515 (1971)","journal-title":"JACM"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/355791.355795","volume":"4","author":"WS Brown","year":"1978","unstructured":"Brown, W.S.: The subresultant PRS algorithm. ACM TOMS 4, 237\u2013249 (1978)","journal-title":"ACM TOMS"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1080\/00029890.1966.11970820","volume":"71","author":"GE Collins","year":"1966","unstructured":"Collins, G.E.: Polynomial remainder sequences and determinants. Am. Math. Mon. 71, 708\u2013712 (1966)","journal-title":"Am. Math. Mon."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"GE Collins","year":"1967","unstructured":"Collins, G.E.: Subresultants and reduced polynomial remainder sequences. JACM 14, 128\u2013142 (1967)","journal-title":"JACM"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-4049(98)00081-4","volume":"145","author":"L Ducos","year":"2000","unstructured":"Ducos, L.: Optimizations of the subresultant algorithm. J. Pure Appl. Algebra 145, 149\u2013163 (2000)","journal-title":"J. Pure Appl. Algebra"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02568027","volume":"21","author":"W Habicht","year":"1948","unstructured":"Habicht, W.: Zur inhomogenen Eliminationstheorie. Comm. Math. Helvetici 21, 79\u201398 (1948)","journal-title":"Comm. Math. Helvetici"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-09519-5_74","volume-title":"Symbolic and Algebraic Computation","author":"AC Hearn","year":"1979","unstructured":"Hearn, A.C.: Non-modular computation of polynomial GCDS using trial division. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 227\u2013239. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_74"},{"key":"24_CR9","series-title":"Computing Supplementum","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-7091-3406-1_9","volume-title":"Computer Algebra","author":"R Loos","year":"1982","unstructured":"Loos, R.: Generalized polynomial remainder sequence. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra. Computing Supplementum, vol. 4, pp. 115\u2013137. Springer, Vienna (1982). https:\/\/doi.org\/10.1007\/978-3-7091-3406-1_9"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s13160-013-0133-1","volume":"31","author":"T Sasaki","year":"2014","unstructured":"Sasaki, T.: A subresultant-like theory for Buchberger\u2019s procedure. JJIAM (Jap. J. Indust. Appl. Math.) 31, 137\u2013164 (2014)","journal-title":"JJIAM (Jap. J. Indust. Appl. Math.)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.2977\/prims\/1195181611","volume":"20","author":"T Sasaki","year":"1984","unstructured":"Sasaki, T., Furukawa, A.: Theory of multiple polynomial remainder sequence. Publ. RIMS (Kyoto Univ.) 20, 367\u2013399 (1984)","journal-title":"Publ. RIMS (Kyoto Univ.)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Sasaki, T., Inaba, D.: Simple relation between the lowest-order element of ideal $$\\langle G, H \\rangle $$ and the last element of polynomial remainder sequence. In: Proceedings of SYNASC 2017 (Symbolic and Numeric Algorithms for Scientific Computing), IEEE Computer Society (2017, in printing)","DOI":"10.1109\/SYNASC.2017.00019"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0747-7171(08)80105-8","volume":"13","author":"T Sasaki","year":"1992","unstructured":"Sasaki, T., Suzuki, M.: Three new algorithms for multivariate polynomial GCD. J. Symb. Comput. 13, 395\u2013411 (1992)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T15:38:49Z","timestamp":1571758729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}