{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:01:00Z","timestamp":1794337260237,"version":"4.9.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"value":"354013350X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032851","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:41:26Z","timestamp":1133412086000},"page":"285-296","source":"Crossref","is-referenced-by-count":10,"title":["GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation"],"prefix":"10.1007","author":[{"given":"Bruce W.","family":"Char","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keith O.","family":"Geddes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaston H.","family":"Gonnet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Donald Knuth, The Art of Computer Programming, vol. 2, 2nd ed., Addison Wesley (1981)."},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G.E. Collins","year":"1967","unstructured":"G.E. Collins, \u201cSubresultants and Reduced Polynomial Remainder Sequences,\u201d Journal of the ACM 14, pp. 128\u2013142 (1967).","journal-title":"Journal of the ACM"},{"issue":"3","key":"28_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/355791.355795","volume":"4","author":"W.S. Brown","year":"1978","unstructured":"W.S. Brown, \u201cThe Subresultant PRS Algorithm,\u201d ACM Transactions on Mathematical Software 4(3), pp. 237\u2013249 (1978).","journal-title":"ACM Transactions on Mathematical Software"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Anthony Hearn, \u201cNon-modular computation of polynomial GCD's using trial division,\u201d Proceedings of Eurosam 79, pp. 227\u2013239, Springer-Verlag (1979). Springer-Verlag Lecture Notes in Computer Science no. 72.","DOI":"10.1007\/3-540-09519-5_74"},{"issue":"4","key":"28_CR5","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","volume":"18","author":"W.S. Brown","year":"1971","unstructured":"W.S. Brown, \u201cOn Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors,\u201d Journal of the ACM 18(4), pp. 478\u2013504 (1971).","journal-title":"Journal of the ACM"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Richard Zippel, \u201cProbabilistic Algorithms for Sparse Polynomials,\u201d Proceedings of Eurosam 79, pp. 216\u2013226, Springer-Verlag (1979). Springer-Verlag Lecture Notes in Computer Science no. 72.","DOI":"10.1007\/3-540-09519-5_73"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Joel Moses and David Y.Y. Yun, \u201cThe EZ GCD Algorithm,\u201d pp. 159\u2013166 in Proceedings of the ACM Annual Conference (August 1973).","DOI":"10.1145\/800192.805698"},{"issue":"2","key":"28_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1089220.1089228","volume":"14","author":"W. Paul","year":"1980","unstructured":"Paul Wang, \u201cThe EEZ-GCD Algorithm,\u201d SIGSAM Bulletin 14(2), pp. 50\u201360 (May 1980).","journal-title":"SIGSAM Bulletin"},{"key":"28_CR9","unstructured":"D. Lazard, \u201cFactorization des Polynomes,\u201d in Proceedings of the 4th Journees Algorithmiques, Poitiers (1981)."},{"key":"28_CR10","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974)."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Joachim von zur Gathen, \u201cFactoring Sparse Multivariate Polynomials,\u201d pp. 172\u2013179 in Proceedings of the 24th Annual Symposium on Foundations of Computer Science, IEEE (Nov. 1983).","DOI":"10.1109\/SFCS.1983.15"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"M. Mignotte, \u201cSome Useful Bounds,\u201d pp. 259\u2013263 in Computer Algebra: Symbolic and Algebraic Computation, ed. B. Buchberger, G.E. Collins, and R. Loos, Springer-Verlag (1982).","DOI":"10.1007\/978-3-7091-3406-1_16"},{"key":"28_CR13","unstructured":"Keith O. Geddes, Gaston H. Gonnet, and Bruce W. Char, Maple User's Manual, 3rd edition, University of Waterloo Computer Science Department Research Report CS-83-41, December, 1983."},{"key":"28_CR14","volume-title":"The FRANZ LISP Manual","author":"J. Foderaro","year":"1980","unstructured":"John Foderaro, The FRANZ LISP Manual, Computer Science Division, U. of Calif., Berkeley (1980). For FRANZ LISP version Opus 34b."}],"container-title":["Lecture Notes in Computer Science","EUROSAM 84"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032851.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:07:33Z","timestamp":1607533653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354013350X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0032851","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0032823","asserted-by":"object"}]},"subject":[]}}