{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:40:09Z","timestamp":1776757209754,"version":"3.51.2"},"reference-count":34,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9816,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1016\/0885-064x(86)90001-4","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"179-203","source":"Crossref","is-referenced-by-count":56,"title":["Polynomial division and its computational complexity"],"prefix":"10.1016","volume":"2","author":[{"given":"Dario","family":"Bini","sequence":"first","affiliation":[]},{"given":"Victor","family":"Pan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(86)90001-4_BIB1","series-title":"An Introduction to Numerical Analysis","author":"Atkinson","year":"1978"},{"key":"10.1016\/0885-064X(86)90001-4_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0885-064X(86)90001-4_BIB3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0204045","article-title":"Evaluating polynomials at fixed set of points","volume":"4","author":"Aho","year":"1975","journal-title":"SIAM J. Comput"},{"issue":"No. 2","key":"10.1016\/0885-064X(86)90001-4_BIB4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0213019","article-title":"Parallel solution of certain Toeplitz linear systems","volume":"13","author":"Bini","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(86)90001-4_BIB5","series-title":"Proceedings, 25th Ann. IEEE FOGS Symp.","first-page":"1","article-title":"Log depth circuits for division and related problems","author":"Beam","year":"1984"},{"issue":"No. 5","key":"10.1016\/0885-064X(86)90001-4_BIB6","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","article-title":"O2,7799) complexity for matrix multiplication","volume":"8","author":"Bini","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"Nos. 1\u20133","key":"10.1016\/0885-064X(86)90001-4_BIB7","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 prababilistic machines","volume":"58","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"issue":"No. 3","key":"10.1016\/0885-064X(86)90001-4_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"53","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(86)90001-4_BIB9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0196-6774(80)90013-9","article-title":"Fast solution of Toeplitz systems of equations and computation of Pad\u00e9 approximations","volume":"1","author":"Brent","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0885-064X(86)90001-4_BIB10","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0885-064X(86)90001-4_BIB11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0020-0190(85)90037-7","article-title":"Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power","volume":"21","author":"Bini","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0885-064X(86)90001-4_BIB12","doi-asserted-by":"crossref","DOI":"10.1016\/0898-1221(86)90015-5","article-title":"Fast parallel algorithms for polynomial division over arbitrary fields of constants","author":"Bini","year":"1984"},{"key":"10.1016\/0885-064X(86)90001-4_BIB13","series-title":"Error Analysis of an APA algorithm for the Parallel Solution of Some Special Toeplitz Linear Systems","author":"Codenotti","year":"1983"},{"key":"10.1016\/0885-064X(86)90001-4_BIB14","series-title":"Elementary Numerical Analysis: An Algorithmic Approach","author":"Conte","year":"1980"},{"key":"10.1016\/0885-064X(86)90001-4_BIB15","series-title":"Proceedings, 25th Ann. IEEE Symp. FOCS","first-page":"21","article-title":"Very fast parallel matrix and polynomial arithmetic","author":"Eberly","year":"1984"},{"key":"10.1016\/0885-064X(86)90001-4_BIB16","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/0885-064X(86)90001-4_BIB17","first-page":"563","article-title":"Fast Fourier transform for fun and profit","volume":"29","author":"Gentleman","year":"1966"},{"key":"10.1016\/0885-064X(86)90001-4_BIB18","series-title":"The Numerical Treatment of a Single Nonlinear Equation","author":"Householder","year":"1970"},{"key":"10.1016\/0885-064X(86)90001-4_BIB19","volume":"2","author":"Knuth","year":"1981"},{"key":"10.1016\/0885-064X(86)90001-4_BIB20","first-page":"249","article-title":"Base tensorielle des matrices de Hankel (ou de Toeplitz), applications","volume":"23","author":"Lafon","year":"1975","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90001-4_BIB21","series-title":"Proceedings, Fifth ACM Ann. Symp. on Theory of Computing","first-page":"142","article-title":"Fast computation of GCDs","author":"Moenck","year":"1973"},{"key":"10.1016\/0885-064X(86)90001-4_BIB22","article-title":"The Bit-Operation Complexity of the Convolution of Vectors and of the DFT","author":"Pan","year":"1980"},{"issue":"No.1","key":"10.1016\/0885-064X(86)90001-4_BIB23","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0898-1221(81)90130-9","article-title":"The bit-operation complexity of matrix multiplication and of all pair shortest path problem","volume":"8","author":"Pan","year":"1981","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0885-064X(86)90001-4_BIB24","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0196-6774(81)90016-X","article-title":"The bit-complexity of arithmetic algorithms","volume":"1","author":"Pan","year":"1981","journal-title":"J. Algorithms"},{"issue":"No.2","key":"10.1016\/0885-064X(86)90001-4_BIB25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0898-1221(82)90052-9","article-title":"The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic","volume":"8","author":"Pan","year":"1982","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0885-064X(86)90001-4_BIB26","article-title":"How to Multiply Matrices Faster","volume":"Vol. 179","author":"Pan","year":"1984"},{"issue":"No.9","key":"10.1016\/0885-064X(86)90001-4_BIB27","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0898-1221(85)90095-1","article-title":"The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \u03bb algorithms","volume":"11","author":"Pan","year":"1985","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0885-064X(86)90001-4_BIB28","doi-asserted-by":"crossref","DOI":"10.1016\/0898-1221(87)90137-4","article-title":"Algebraic Complexity of Computing Polynomial Zeros","author":"Pan","year":"1985"},{"key":"10.1016\/0885-064X(86)90001-4_BIB29_1","series-title":"Proceedings, 23rd Ann. IEEE Symp. FOGS","first-page":"138","article-title":"Logarithmic depth circuits for algebraic functions","author":"Reif","year":"1984"},{"key":"10.1016\/0885-064X(86)90001-4_BIB29_2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0885-064X(86)90001-4_BIB30","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0885-064X(86)90001-4_BIB31","series-title":"Proceedings, EUROCAM","article-title":"Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients","author":"Sch\u00f6nhage","year":"1982"},{"key":"10.1016\/0885-064X(86)90001-4_BIB32","series-title":"The fundamental theorem of algebra in terms of computational complexity","author":"Sch\u00f6nhage","year":"1982"},{"key":"10.1016\/0885-064X(86)90001-4_BIB33","series-title":"The Algebraic Eigenvalue Problem","author":"Wilkinson","year":"1965"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:58:50Z","timestamp":1549245530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X86900014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["0885064X86900014"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(86)90001-4","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}