Parallelism and algorithms for algebraic manipulation: current work
- 1 July 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 22 (3) , 7-14
- https://doi.org/10.1145/49456.49457
Abstract
We outline recent results relating to the use of parallelism for solving problems in algebraic manipulation. Practical issues are discussed.Keywords
This publication has 22 references indexed in Scilit:
- Parallel multiplication and powering of polynomialsJournal of Symbolic Computation, 1991
- On the parallel Risch Algorithm (II)ACM Transactions on Mathematical Software, 1985
- Fast parallel absolute irreducibility testingJournal of Symbolic Computation, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- A taxonomy of parallel sortingACM Computing Surveys, 1984
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial EntriesACM Transactions on Mathematical Software, 1976
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and RecurrencesJournal of the ACM, 1976