On the multi-threaded computation of integral polynomial greatest common divisors
- 1 June 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 333-342
- https://doi.org/10.1145/120694.120747
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Integer multiplication in PARSAC-2 on stock microprocessorsPublished by Springer Nature ,1991
- Linda in contextCommunications of the ACM, 1989
- Parallel processors and systems for algebraic manipulation: current workACM SIGSAM Bulletin, 1988
- Parallelism and algorithms for algebraic manipulation: current workACM SIGSAM Bulletin, 1988
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Newton's iteration and the sparse Hensel algorithm (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1981
- The EEZ-GCD algorithmACM SIGSAM Bulletin, 1980
- The algorithm description language ALDES (report)ACM SIGSAM Bulletin, 1976
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971