Parallel Algorithms for Algebraic Problems
- 1 November 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (4) , 802-824
- https://doi.org/10.1137/0213050
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- The classification of problems which have fast parallel algorithmsLecture Notes in Computer Science, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967