On the multi-threaded computation of modular polynomial greatest common divisors
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 369-384
- https://doi.org/10.1007/3-540-55437-8_93
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Progress report on a system for general-purpose parallel symbolic algebraic computationPublished by Association for Computing Machinery (ACM) ,1990
- Parallel processors and systems for algebraic manipulation: current workACM SIGSAM Bulletin, 1988
- Parallelism and algorithms for algebraic manipulation: current workACM SIGSAM Bulletin, 1988
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985
- Computing with polynomials given by straight-line programs I: greatest common divisorsPublished by Association for Computing Machinery (ACM) ,1985
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Using an effective grading method for preventing plagiarism of programming assignmentsACM SIGCSE Bulletin, 1982
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- The EZ GCD algorithmPublished by Association for Computing Machinery (ACM) ,1973
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971