Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm

doi:10.1145/362835.362839

Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm

Full Text:

PDF

Buy this Article

Authors:	S. Y. Ku	Case Western Reserve Univ., Cleveland, OH
	R. J. Adler	Case Western Reserve Univ., Cleveland, OH

Published in:

	· Magazine
	Communications of the ACM CACM Homepage archive
	Volume 12 Issue 1, Jan. 1969 Pages 23-30 ACM New York, NY, USA table of contents doi>10.1145/362835.362839

	1969 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 24 · Downloads (cumulative): 524 · Citation Count: 9

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms bezout's determinant computations on polynomials design elimination euclidean algorithm g.c.d algorithm multivariate polynomial equations multivariate statistics polynomial resultant polynomials, methods for reduced p.r.s algorithm resultant algorithm sylvester's determinant theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player