{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:56Z","timestamp":1725663476917},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541950"},{"type":"electronic","value":"9783540474890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54195-0_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:35:11Z","timestamp":1330191311000},"page":"222-233","source":"Crossref","is-referenced-by-count":2,"title":["An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field"],"prefix":"10.1007","author":[{"given":"Lars","family":"Langemyr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"20_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974."},{"issue":"4","key":"20_CR2","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","volume":"18","author":"W. S. Brown","year":"1971","unstructured":"W. S. Brown. On Euclid's algorithm and the computation of polynomial greatest common divisors. Journal of the ACM, 18(4):478\u2013504, October 1971.","journal-title":"Journal of the ACM"},{"key":"20_CR3","unstructured":"D. G. Cantor and E. Kaltofen. Fast multiplication over arbitrary rings. 1986. Manuscript."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"B. W. Char, K. O. Geddes, and G. H. Gonnet. Gcdheu: heuristic polynomials gcd algorithm based on integer gcd computation. In Proc. EUROSAM '84, pages 285\u2013296, Springer-Verlag, 1984. Lecture Notes in Computer Science 174.","DOI":"10.1007\/BFb0032851"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1145\/321662.321666","volume":"18","author":"G. E. Collins","year":"1971","unstructured":"G. E. Collins. The calculation of multivariate polynomial resultants. Journal of the ACM, 18:515\u2013532, 1971.","journal-title":"Journal of the ACM"},{"key":"20_CR6","unstructured":"D. Duval. Diverse questions relatives au CALCUL FORMEL AVEC DES NOMBRES ALG\u00c9BRIQUES. PhD thesis, L'universit\u00e9 scientifique, technologique, et m\u00e9dicale de Grenoble, Grenoble, April 1987."},{"key":"20_CR7","volume-title":"The Art of Computer Programming II: Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth. The Art of Computer Programming II: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1981."},{"key":"20_CR8","unstructured":"L. Langemyr. Computing the GCD of two Polynomials Over an Algebraic Number Field. PhD thesis, NADA, Royal Institute of Technology, Stockholm, 1988."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0747-7171(89)80053-7","volume":"8","author":"L. Langemyr","year":"1989","unstructured":"L. Langemyr and S. McCallum. The computation of polynomial greatest common divisors over an algebraic number field. J. Symbolic Comp., 8:429\u2013448, 1989.","journal-title":"J. Symbolic Comp."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"L. Langemyr. An Analysis of the Subresultant Algorithm over an Algebraic Number Field. 1990. Manuscript.","DOI":"10.1145\/120694.120716"},{"key":"20_CR11","first-page":"115","volume-title":"Computer Algebra, Symbolic and Algebraic Computation","author":"R. G. K. Loos","year":"1982","unstructured":"R. G. K. Loos. Generalized polynomial remainder sequences. In B. Buchberger, G. E. Collins, and R. G. K. Loos, editors, Computer Algebra, Symbolic and Algebraic Computation, pages 115\u2013137, Springer-Verlag, Wien-New York, 1982."},{"issue":"2","key":"20_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"Michael O. Rabin. Probabilistic algorithms for finite fields. SIAM Journal on Computing, 9(2):273\u2013280, May 1980.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. B. Rosser","year":"1962","unstructured":"J. B. Rosser and L. Schoenfeld. Approximate formulas for some functions of prime numbers. Illinois J. Math., 6:64\u201394, 1962.","journal-title":"Illinois J. Math."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0196-6774(88)90027-2","volume":"9","author":"A. Sch\u00f6nhage","year":"1988","unstructured":"A. Sch\u00f6nhage. Probabilistic computation of integer polynomial GCDs. J. of Algorithms, 9:365\u2013371, 1988.","journal-title":"J. of Algorithms"},{"key":"20_CR15","unstructured":"V. Shoup. On the Deterministic Complexity of Factoring Polynomials over Finite Fields. Technical Report 782, Computer Science Department, University of Wisconsin-Madison, July 1988."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"T. J. Smedley. A new modular algorithm for computation of algebraic number polynomial Gcds. In Proc. ISSAC '89, pages 91\u201394, ACM, July 1989.","DOI":"10.1145\/74540.74552"},{"issue":"4","key":"20_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/355705.355709","volume":"2","author":"P. J. Weinberger","year":"1976","unstructured":"P. J. Weinberger and L. P. Rothschild. Factoring polynomials over algebraic number fields. ACM Transactions on Mathematical Software, 2(4):335\u2013350, December 1976.","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54195-0_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:53:00Z","timestamp":1605628380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54195-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541950","9783540474890"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54195-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}