Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

Authors:
W. M. Gentleman;S. C. Johnson
Affiliations:
Mathematics Faculty Computing Faculty, University of Waterloo, Waterloo, Ont., Canada;Bell Telephone Laboratories, Murray Hill, NJ
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1976

Citing 1
Cited 5

Optimal multiplication chains for computing a power of a symbolic polynomial

ACM SIGSAM Bulletin

Systems of linear equations with dense univariate polynomial coefficients

Journal of the ACM (JACM)
Parallelism and algorithms for algebraic manipulation: current work

ACM SIGSAM Bulletin
The Subresultant PRS Algorithm

ACM Transactions on Mathematical Software (TOMS)
Cited References

Computer algebra handbook
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract