The Subresultant PRS Algorithm
- 1 September 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 4 (3) , 237-249
- https://doi.org/10.1145/355791.355795
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial EntriesACM Transactions on Mathematical Software, 1976
- A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials (A. J. Goldstein and R. L. Graham)SIAM Review, 1974
- An improved non-modular polynomial GCD algorithmACM SIGSAM Bulletin, 1972
- 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
- Letters to the editor: comment on a paper by Ku and AdlerCommunications of the ACM, 1969
- Computing polynomial resultantsCommunications of the ACM, 1969
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967