Fast parallel algorithms for polynomial division over an arbitrary field of constants
- 1 November 1986
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 12 (11) , 1105-1118
- https://doi.org/10.1016/0898-1221(86)90015-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Logarithmic Depth Circuits for Algebraic FunctionsSIAM Journal on Computing, 1986
- Fast parallel polynomial division via reduction to triangular toeplitz matrix inversion and to polynomial inversion modulo a powerInformation Processing Letters, 1985
- How Can We Speed Up Matrix Multiplication?SIAM Review, 1984
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980