{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:49Z","timestamp":1725664309593},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591757"},{"type":"electronic","value":"9783540492207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59175-3_100","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:04:51Z","timestamp":1330275891000},"page":"332-345","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of computing the greatest common divisor of several univariate polynomials"],"prefix":"10.1007","author":[{"given":"Laureano","family":"Gonz\u00e1lez-Vega","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"24_CR1","unstructured":"A. G. Akritas: Elements of Computer Algebra with Applications. Wiley-Interscience (1989)."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"S. Berkowitz: On computing the determinant in small parallel time with a small number of processors. Information Processing Letters, 18 (1984).","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","volume":"118","author":"W. S. Brown","year":"1971","unstructured":"W. S. Brown and J. F. Traub: On Euclid's algorithm and the theory of subresultants. Journal of Association for Computing Machinery, 118, 505\u2013514 (1971).","journal-title":"Journal of Association for Computing Machinery"},{"key":"24_CR4","unstructured":"S. Barnett: Polynomials and Linear Control Systems. Marcel Dekker, Inc."},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0305004100049860","volume":"70","author":"S. Barnett","year":"1971","unstructured":"S. Barnett: Greatest common divisor of several polynomials. Proc. Cambridge Philos. Soc., 70, 263\u2013268 (1971).","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1017\/S0305004100044923","volume":"66","author":"S. Barnett","year":"1970","unstructured":"S. Barnett: Degrees of greatest common divisors of invariant factors of two regular polynomial matrices. Proc. Camb. Phil. Soc., 66, 241\u2013245 (1970).","journal-title":"Proc. Camb. Phil. Soc."},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G. E. Collins","year":"1967","unstructured":"G. E. Collins: Subresultants and reduced polynomial remainder sequences. Journal of Association for Computing Machinery, 14, 128\u2013142 (1967).","journal-title":"Journal of Association for Computing Machinery"},{"issue":"4","key":"24_CR8","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","volume":"13","author":"J. Gathen von zur","year":"1984","unstructured":"J. von zur Gathen: Parallel algorithms for algebraic problems. Siam Journal on Computing, 13, 4, 802\u2013824 (1984).","journal-title":"Siam Journal on Computing"},{"issue":"6","key":"24_CR9","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1051\/ita\/1990240605611","volume":"24","author":"L. Gonz\u00e1lez-Vega","year":"1990","unstructured":"L. Gonz\u00e1lez-Vega, H. Lombardi, T. Recio and M.-F. Roy: Specialisation de la suite de Sturm et sous-resultants. Informatique Theorique et Applications, 24, 6, 561\u2013588 (1990).","journal-title":"Informatique Theorique et Applications"},{"key":"24_CR10","unstructured":"L. Gonz\u00e1lez-Vega: An elementary proof of Barnett's Theorem about the greatest common divisor of several univariate polynomials. Submitted to Linear Algebra and Applications (1994)."},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02568028","volume":"21","author":"V. W. Habicht","year":"1948","unstructured":"V. W. Habicht: Eine Verallgemeinerung des Sturmschen Wurzelzahlverfahrens. Comm. Math. Helvetici, 21, 99\u2013116 (1948).","journal-title":"Comm. Math. Helvetici"},{"key":"24_CR12","volume-title":"Ph. D. Thesis","author":"C. Ho","year":"1989","unstructured":"C. Ho: Topics in Algebraic Computing: Subresultants, GCD, factoring, and primary ideal decomposition. Ph. D. Thesis. Courant Institute of Mathematical Sciences. New York (1989)."},{"key":"24_CR13","unstructured":"D. Ierardi and D. Kozen: Parallel resultant computation. Synthesis of Parallel Algorithms, ed. J. Reif, Morgan Kaufmann. Also technical report 90-1987, Department of Computer Science, Cornell University (1990)."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"R. E. Kalman. Some computational problems and m\u00e9thods related to invariant factors and control theory. Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, 393\u2013398 (1970).","DOI":"10.1016\/B978-0-08-012975-4.50039-4"},{"key":"24_CR15","unstructured":"D. Knuth: The art of computer programming II: Seminumerical Algorithms. Reading Mass., first edition 1969, second edition 1982."},{"issue":"1","key":"24_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0747-7171(92)90003-M","volume":"13","author":"J. LLovet","year":"1992","unstructured":"J. LLovet and J. R. Sendra: An Extended Polynomial GCD Algorithm using Hankel Matrices. Journal of Symbolic Computation, 13(1), 25\u201339 (1992).","journal-title":"Journal of Symbolic Computation"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"H. Lombardi: Algebre \u00c9l\u00e9mentaire en temps polynomial. Ph. D. Thesis. University of Nice (1989).","DOI":"10.5802\/pmb.a-61"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"R. Loos: Generalized polynomial remainder sequences. Computer Algebra, Computing Suplementum 4, Springer Verlag, 115\u2013138 (1982).","DOI":"10.1007\/978-3-7091-3406-1_9"},{"key":"24_CR19","first-page":"154","volume":"57","author":"C. C. MacDuffee","year":"1950","unstructured":"C. C. MacDuffee: Some applications of matrices in the theory of equations. American Mathematical Monthly, 57, 154\u2013161 (1950).","journal-title":"American Mathematical Monthly"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"M. Mignotte: Mathematics for Computer Algebra. Springer-Verlag (1992).","DOI":"10.1007\/978-1-4613-9171-5"},{"key":"24_CR21","first-page":"259","volume-title":"Some useful bounds. Computer Algebra","author":"M. Mignotte","year":"1982","unstructured":"M. Mignotte: Some useful bounds. Computer Algebra, ed. B. Buchberger, G.E. Collins and R. Loos, pag. 259\u2013263. Computing Suplementum 4, Springer Verlag, NY (1982)."},{"issue":"1","key":"24_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica, 7(1), 101\u2013104 (1987).","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","LATIN '95: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59175-3_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:03:54Z","timestamp":1640941434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59175-3_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591757","9783540492207"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-59175-3_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}