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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (480 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 , Issue 3 (September 1976) table of contents

Pages: 232 - 241

Year of Publication: 1976

ISSN:0098-3500

Authors

W. M. Gentleman	Mathematics Faculty Computing Faculty, University of Waterloo, Waterloo, Ont., Canada
S. C. Johnson	Bell Telephone Laboratories, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 26, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355694.355696 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BAREISS, E H. Sllvester's ~dentlty and multistep integer-preserving Gaussian ehmination. Math. Computatwn 22 (1968), 565-578.
	2	FATEMAN, R.J. On the computational powers of polynomials. Dep. Math. Rep., M.I.T., Cambridge, Mass.
	3	W. Morven Gentleman, Optimal multiplication chains for computing a power of a symbolic polynomial, ACM SIGSAM Bulletin [doi>10.1145/1093425.1093426]
	4	HEINDEL, L.E. Computation of powers of multivariate polynomials over the integers. J. Computer Syst. Sci., 1 (Feb. 1972).
	5	LIPSON, J.D. Symbohc methods for the computer solution of linear equations with apphcatlons to flowgraphs. In P.G. Tobey, Ed., Proc. 1968 Summer Institute on Symbohc Mathematmal Computation, I.B.M. Programming Lab. Rep. FSC69-0312, June 1969.

CITED BY 4

	W. S. Brown, The Subresultant PRS Algorithm, ACM Transactions on Mathematical Software (TOMS), v.4 n.3, p.237-249, Sept. 1978
	Stanley Cabay , Bart Domzy, Systems of linear equations with dense univariate polynomial coefficients, Journal of the ACM (JACM), v.34 n.3, p.646-660, July 1987
	Carl G. Ponder, Parallelism and algorithms for algebraic manipulation: current work, ACM SIGSAM Bulletin, v.22 n.3, p.7-14, July 1988
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003