A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- 1 December 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (6) , 1081-1092
- https://doi.org/10.1137/0217069
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Representations and Parallel Computations for Rational FunctionsSIAM Journal on Computing, 1986
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Integer Arithmetic Algorithms for Polynomial Real Zero DeterminationJournal of the ACM, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Polynomial Remainder Sequences and DeterminantsThe American Mathematical Monthly, 1966