{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:06Z","timestamp":1760245086095,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878261"},{"type":"electronic","value":"9783540878278"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_7","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"87-96","source":"Crossref","is-referenced-by-count":3,"title":["Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix"],"prefix":"10.1007","author":[{"given":"Nor\u2019aini","family":"Aris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shamsatun","family":"Nahar Ahmad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Rahman, A.A., Aris, N.: The State of the art in Exact polynomial GCD computations. In: Proceedings Malaysian Science and Technology Conference (2002)"},{"key":"7_CR2","unstructured":"Rahman, A.A.: The use of GCD computation to remove repeated zeroes from a floating point polynomial. In: Proceedings SCAN 1992, Oldedenberg, Germany (1992)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0024-3795(75)90041-5","volume":"12","author":"S. Barnett","year":"1975","unstructured":"Barnett, S.: A companion matrix analogue for orthogonal polynomials. Linear Algebra and its Applications\u00a012, 197\u2013208 (1975)","journal-title":"Linear Algebra and its Applications"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0024-3795(78)90057-5","volume":"22","author":"S. Barnett","year":"1978","unstructured":"Barnett, S., Maroulas, J.: Greatest common divisor of generalized polynomial and polynomial matrices. Linear Algebra and its Applications\u00a022, 195\u2013210 (1978)","journal-title":"Linear Algebra and its Applications"},{"key":"7_CR5","volume-title":"Polynomial and Linear Control Systems","author":"S. Barnett","year":"1983","unstructured":"Barnett, S.: Polynomial and Linear Control Systems. Marcel Dekker, New York (1983)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0024-3795(84)90077-6","volume":"60","author":"S. Barnett","year":"1984","unstructured":"Barnett, S.: Division of generalized polynomials using the comrade matrix. Linear Algebra and its Applications\u00a060, 159\u2013175 (1984)","journal-title":"Linear Algebra and its Applications"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brown, W.S.: On Euclid\u2019s algorithm and polynomial greatest common divisors \u00a018(1), 478\u2013504 (1971)","DOI":"10.1145\/321662.321664"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0203001","volume":"3","author":"G.E. Collins","year":"1974","unstructured":"Collins, G.E.: The computing time of the Euclidean algorithm. SIAM Journal on Computing\u00a03(1), 1\u201310 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Collins, G.E., Mignotte, M., Winkler, F.: Arithmetic in basic algebraic domains: Computing Suppl. \u00a04, 189\u2013220 (1982)","DOI":"10.1007\/978-3-7091-3406-1_13"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Labahn, G., Cheng, H.: On computing polynomial GCDs in alternate bases. In: Proceedings ISSAC 2006, pp. 47\u201354 (2006)","DOI":"10.1145\/1145768.1145783"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321784.321787","volume":"20","author":"M.T. McClellan","year":"1973","unstructured":"McClellan, M.T.: The exact solution of systems of linear equations with polynomial coefficients. J. ACM\u00a020(4), 563\u2013588 (1973)","journal-title":"J. ACM"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/355732.355735","volume":"3","author":"M.T. McClellan","year":"1977","unstructured":"McClellan, M.T.: A comparison of algorithms for the exact solutions of linear equations. ACM Trans. Math. Software\u00a03(2), 147\u2013158 (1977)","journal-title":"ACM Trans. Math. Software"},{"key":"7_CR13","first-page":"40","volume-title":"On the division of generalized polynomials. Lecture Notes Series On Computing","author":"N. Aris","year":"2003","unstructured":"Aris, N., Rahman, A.A.: On the division of generalized polynomials. Lecture Notes Series On Computing, vol.\u00a010, pp. 40\u201351. World Scientific Computing, Singapore (2003)"},{"key":"7_CR14","unstructured":"Rubald, C.M.: Algorithms for Polynomials over a Real Algebraic Number Field. University of Wisconsin: Ph.D. Thesis (1973)"}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T01:06:30Z","timestamp":1738371990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}