{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:16:34Z","timestamp":1725646594042},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387970196"},{"type":"electronic","value":"9781461396475"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/978-1-4613-9647-5_19","type":"book-chapter","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T03:00:25Z","timestamp":1324954825000},"page":"145-155","source":"Crossref","is-referenced-by-count":2,"title":["Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method"],"prefix":"10.1007","author":[{"given":"Alkiviadis G.","family":"Akritas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02278715","volume":"38","author":"AG Akritas","year":"1987","unstructured":"Akritas, A.G.:A simple validity proof of the reduced prs algorithm. Computing 38, 369\u2013372, 1987.","journal-title":"Computing"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01398685","volume":"52","author":"AG Akritas","year":"1988","unstructured":"Akritas, A.G.:A new method for computing greatest common divisors and polynomial remainder sequences. Numerische Mathematik 52,119\u2013127, 1988.","journal-title":"Numerische Mathematik"},{"key":"19_CR3","unstructured":"Akritas, A.G.:Elements of Computer Algebra with Applications. John Wiley, New York, in press."},{"key":"19_CR4","first-page":"565","volume":"22","author":"EH Bareiss","year":"1968","unstructured":"Bareiss, E.H.:Sylvester\u2019s identity and multistep integer-preserving Gaussian elimination. Mathematics of Computation 22,565\u2013578, 1968.","journal-title":"Mathematics of Computation"},{"key":"19_CR5","first-page":"476","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, 476\u2013504, 1971.","journal-title":"JACM"},{"key":"19_CR6","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 Transactions On Mathematical Software 4, 237\u2013249, 1978.","journal-title":"ACM Transactions On Mathematical Software"},{"key":"19_CR7","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":"19_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02568028","volume":"21","author":"W Habicht","year":"1948","unstructured":"Habicht, W.:Eine Verallgemeinerung des Sturmschen Wurzelz\u00e4hlverfahrens. Commentarii Mathematici Helvetia 21, 99\u2013116, 1948.","journal-title":"Commentarii Mathematici Helvetia"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.2307\/2689124","volume":"42","author":"MA Laidacker","year":"1969","unstructured":"Laidacker, M.A.:Another theorem relating Sylvester\u2019s matrix and the greatest common divisor. Mathematics Magazine 42,126\u2013128,1969.","journal-title":"Mathematics Magazine"},{"key":"19_CR10","first-page":"115","volume-title":"Computer Algebra Symbolic and Algebraic Computations","author":"R Loos","year":"1982","unstructured":"Loos, R.:Generalized polynomial remainder sequences. In: Computer Algebra Symbolic and Algebraic Computations. Ed. by B. Buchberger, G.E. Collins and R. Loos, Springer Verlag, Wien, New York, 1982, Computing Supplement 4,115\u2013137."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1098\/rstl.1853.0018","volume":"143","author":"JJ Sylvester","year":"1853","unstructured":"Sylvester, J.J.:On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm\u2019s functions, and that of the greatest algebraical common measure. Philoshophical Transactions 143,407\u2013548, 1853.","journal-title":"Philoshophical Transactions"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1967260","volume":"1","author":"EB Vleck Van","year":"1899","unstructured":"Van Vleck, E. B.:On the determination of a series of Sturm\u2019s functions by the calculation of a single determinant. Annals of Mathematics, Second Series, Vol. 1,1\u201313, 1899\u20131900.","journal-title":"Annals of Mathematics, Second Series"}],"container-title":["Computers and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4613-9647-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T09:10:17Z","timestamp":1619860217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4613-9647-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9780387970196","9781461396475"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4613-9647-5_19","relation":{},"subject":[],"published":{"date-parts":[[1989]]}}}