{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:30:26Z","timestamp":1725550226770},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289661"},{"type":"electronic","value":"9783540320708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11555964_38","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:25:34Z","timestamp":1127831134000},"page":"445-456","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Polynomial Remainder Sequence and the Nested Subresultants"],"prefix":"10.1007","author":[{"given":"Akira","family":"Terui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1998)","edition":"3"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G.E. Collins","year":"1967","unstructured":"Collins, G.E.: Subresultants and Reduced Polynomial Remainder Sequences. J. ACM\u00a014, 128\u2013142 (1967)","journal-title":"J. ACM"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"W.S. Brown","year":"1971","unstructured":"Brown, W.S., Traub, J.F.: On Euclid\u2019s Algorithm and the Theory of Subresultants. J. ACM\u00a018, 505\u2013514 (1971)","journal-title":"J. ACM"},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-7091-7551-4_9","volume-title":"Computer Algebra: Symbolic and Algebraic Computation","author":"R. Loos","year":"1983","unstructured":"Loos, R.: Generalized polynomial remainder sequences. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra: Symbolic and Algebraic Computation, 2nd edn., pp. 115\u2013137. Springer, Heidelberg (1983)","edition":"2"},{"unstructured":"Terui, A.: Subresultants in recursive polynomial remainder sequence. In: Ganzha, V., Mayr, E., Vorozhtsov, E. (eds.) Proc. The Sixth Computer Algebra in Scientific Computing: CASC 2003, M\u00fcnchen, pp. 363\u2013375. Institute f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen (2003)","key":"38_CR5"},{"unstructured":"Terui, A.: Recursive polynomial remainder sequence and calculation of the number of real zeros of univariate polynomial (in Japanese). In: Noro, M. (ed.) Computer algebra\u2014algorithms, implementations and applications (Kyoto, 2003), Research Institute for Mathematical Sciences, Kyoto Univ., Kyoto. RIMS Collection of Research Reports, vol.\u00a01395, pp. 97\u2013103 (2004)","key":"38_CR6"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(02)00639-4","volume":"297","author":"J. zur Gathen von","year":"2003","unstructured":"von zur Gathen, J., L\u00fccking, T.: Subresultants revisited. Theoret. Comput. Sci.\u00a0297, 199\u2013239 (2003); Latin American theoretical informatics (Punta del Este, 2000)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.2307\/2004533","volume":"22","author":"E.H. Bareiss","year":"1968","unstructured":"Bareiss, E.H.: Sylvester\u2019s identity and multistep integer-preserving Gaussian elimination. Math. Comp.\u00a022, 565\u2013578 (1968)","journal-title":"Math. Comp."},{"key":"38_CR9","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"38_CR10","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\u00a0145, 149\u2013163 (2000)","journal-title":"J. Pure Appl. Algebra"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1006\/jsco.1999.0322","volume":"29","author":"H. Lombardi","year":"2000","unstructured":"Lombardi, H., Roy, M.F., El Din, M.S.: New structure theorem for subresultants. J. Symbolic Comput.\u00a029, 663\u2013689 (2000)","journal-title":"J. Symbolic Comput."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/220346.220371","volume-title":"Proc. ISSAC 1995","author":"R.M. Corless","year":"1995","unstructured":"Corless, R.M., Gianni, P.M., Trager, B.M., Watt, S.M.: The singular value decomposition for polynomial systems. In: Proc. ISSAC 1995, pp. 195\u2013207. ACM, New York (1995)"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0022-4049(97)00013-3","volume":"117\/118","author":"I.Z. Emiris","year":"1997","unstructured":"Emiris, I.Z., Galligo, A., Lombardi, H.: Certified approximate univariate GCDs. J. Pure Appl. Algebra\u00a0117\/118, 229\u2013251 (1997); Algorithms for algebra (Eindhoven, 1996)","journal-title":"J. Pure Appl. Algebra"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/jsco.2002.0542","volume":"34","author":"G.M. Diaz-Toca","year":"2002","unstructured":"Diaz-Toca, G.M., Gonzalez-Vega, L.: Barnett\u2019s theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices. J. Symbolic Comput.\u00a034, 59\u201381 (2002)","journal-title":"J. Symbolic Comput."},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0022-4049(99)00014-6","volume":"139","author":"D. Rupprecht","year":"1999","unstructured":"Rupprecht, D.: An algorithm for computing certified approximate GCD of n univariate polynomials. J. Pure and Applied Algebra\u00a0139, 255\u2013284 (1999)","journal-title":"J. Pure and Applied Algebra"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11555964_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:24Z","timestamp":1619507244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11555964_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289661","9783540320708"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11555964_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}