The Subresultant PRS Algorithm
W. S. Brown · ACM Transactions on Mathematical Software · 1978
article The Subresultant PRS Algorithm Share on Author: W. S. Brown Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ Bell Laboratories, 600 Mountain Ave., Murray Hill, NJView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 4Issue 3Sept. 1978 pp 237–249https://doi.org/10.1145/355791.355795Online:01 September 1978Publication History 53citation574DownloadsMetricsTotal Citations53Total Downloads574Last 12 Months42Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Cited by 81 works. doi:10.1145/355791.355795
References
- The Art of Computer Programming
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- The EZ GCD algorithm
- Computing polynomial resultants
- Letters to the editor: comment on a paper by Ku and Adler
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials (A. J. Goldstein and R. L. Graham)
- An improved non-modular polynomial GCD algorithm