{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:08:34Z","timestamp":1648922914503},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90234-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"129-134","source":"Crossref","is-referenced-by-count":0,"title":["Circuits for computing the GCD of two polynomials over an algebraic number field"],"prefix":"10.1016","volume":"38","author":[{"given":"Lars","family":"Langemyr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90234-9_BIB1","first-page":"1","article-title":"Log depth circuits for division and related problems","author":"Beame","year":"1984","journal-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(91)90234-9_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","article-title":"On computing the determinant in small parallel time using a small number of processors","volume":"18","author":"Berkowitz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90234-9_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","article-title":"Parallel computation for well-endowed rings and space bounded probabilistic machines","volume":"58","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90234-9_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and gcd computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90234-9_BIB5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","article-title":"Subresultants and reduced polynomial remainder sequences","volume":"14","author":"Collins","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90234-9_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"62","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90234-9_BIB7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90234-9_BIB8","first-page":"21","article-title":"Very fast parallel matrix and polynomial arithmetic","author":"Eberly","year":"1984","journal-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(91)90234-9_BIB9","series-title":"Tech. Rept. UCB\u29f8CSD 88\u29f8408","article-title":"A survey of parallel algorithms for shared memory machines","author":"Karp","year":"1988"},{"key":"10.1016\/0020-0190(91)90234-9_BIB10","series-title":"PhD thesis","article-title":"Computing the GCD of two polynomials over an algebraic number field","author":"Langemyr","year":"1988"},{"key":"10.1016\/0020-0190(91)90234-9_BIB11","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0747-7171(89)80053-7","article-title":"The computation of polynomial greatest common divisors over an algebraic number field","volume":"8","author":"Langemyr","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0020-0190(91)90234-9_BIB12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","article-title":"Logarithmic depth circuits for algebraic functions","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90234-9_BIB13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Illinois J. Math."},{"key":"10.1016\/0020-0190(91)90234-9_BIB14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0304-3975(79)90017-3","article-title":"On multiplications in algebraic extension fields","volume":"8","author":"Winograd","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:41:33Z","timestamp":1580881293000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091902349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0020019091902349"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90234-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}