Evaluation of the heuristic polynomial GCD

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Evaluation of the heuristic polynomial GCD

Full text

Pdf (901 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1995 international symposium on Symbolic and algebraic computation table of contents

Montreal, Quebec, Canada

Pages: 240 - 247

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

Hsin-Chao Liao	Computer Science Division, EECS Department, University of California at Berkeley
Richard J. Fateman	Computer Science Division, EECS Department, University of California at Berkeley

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

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/220346.220376 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	W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
	2	S.-C. Chou, Mechanical geometry theorem proving, Kluwer Academic Publishers, Norwell, MA, 1987
	3	George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM (JACM), v.14 n.1, p.128-142, Jan. 1967 [doi>10.1145/321371.321381]
	4	Richard J. Fateman, A lisp-language Mathematica-to-lisp translator, ACM SIGSAM Bulletin, v.24 n.2, p.19-21, April 1990 [doi>10.1145/1089419.1089421]
	5	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	6	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	7	Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
	8	Paul S. Wang, The EEZ-GCD algorithm, ACM SIGSAM Bulletin, v.14 n.2, p.50-60, May 1980 [doi>10.1145/1089220.1089228]
	9	David Y. Y. Yun, The Hensel Lemma in Algebraic Manipulation, MIT Technical Report MAC TR-138, Project MAC, MIT 1973.
	10	Richard Zippel, Effective Polynomial Computation, Kluwer Academic Publishers, Boston 1993.

CITED BY 2

	Christian Bauer , Alexander Frink , Richard Kreckel, Introduction to the GiNaC framework for symbolic computation within the C⁺⁺ programming language, Journal of Symbolic Computation, v.33 n.1, p.1-12, 01/01/2002
	Zhonggang Zeng , Barry H. Dayton, The approximate GCD of inexact polynomials, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.320-327, July 04-07, 2004, Santander, Spain