Polynomial division and its computational complexity
- 1 September 1986
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 2 (3) , 179-203
- https://doi.org/10.1016/0885-064x(86)90001-4
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fast solution of toeplitz systems of equations and computation of Padé approximantsPublished by Elsevier ,2004
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- Fast parallel algorithms for polynomial division over an arbitrary field of constantsComputers & Mathematics with Applications, 1986
- Fast parallel polynomial division via reduction to triangular toeplitz matrix inversion and to polynomial inversion modulo a powerInformation Processing Letters, 1985
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- The bit-complexity of arithmetic algorithmsJournal of Algorithms, 1981
- The bit-operation complexity of matrix multiplication and of all pair shortest path problemComputers & Mathematics with Applications, 1981
- Evaluating Polynomials at Fixed Sets of PointsSIAM Journal on Computing, 1975