A practical implementation of two rational function decomposition algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A practical implementation of two rational function decomposition algorithms

Full text

Pdf (553 KB)

Source

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

Berkeley, California, United States

Pages: 152 - 157

Year of Publication: 1992

ISBN:0-89791-489-9

Authors

Jaime Gutierrez
Tomas Recio

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): 0, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references 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/143242.143298 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	D R Barton , R Zippel, Polynomial decomposition algorithms, Journal of Symbolic Computation, v.1 n.2, p.159-168, June 1985 [doi>10.1006/jsco.1994.1009]
	2	Matthew T. Dickerson, The Functional Decomposition of Polynomials, Cornell University, Ithaca, NY, 1989
	3	Dorey,M.D.&Whaples,G.: Prime and composite polynomials. J. of Algebra 28, pp. 88-101 (1974).
	4	Evyatar,A$zScott,D.: On polynomials in a Polynomial. Bull. London Math. Society 4, pp. 176-178 (1972).
	5	Fried,M.D.: On a conjelure of Schur. Michigan Math. journal 17, pp. 41-50 (1970).
	6	J. von zur Gathen, Functional decomposition of polynomials: the Tame case, Journal of Symbolic Computation, v.9 n.3, p.281-299, March 1990 [doi>10.1016/S0747-7171(08)80014-4]
	7	J. von zur Gathen, Functional decomposition of polynomials: the wild case, Journal of Symbolic Computation, v.10 n.5, p.437-452, Nov. 1990 [doi>10.1016/S0747-7171(08)80054-5]
	8	Giesbrecht,M.W.: Complexity Results on lhe Functzonal Decomposition of Polynomials. Tech. Rep. 209/88. Dep.Computer Science. University of Toronto (1988).
	9	Gutierrez,J.: A polynomial decomposition algorzthm over factorial domains. Compt. Rendues Math. Acad. Science Canada, Vol. XIII-2, pp. 437-452 (1991).
	10	Jaime Gutierrez , Tomás Recio , C. Ruiz de Velasco, Polynomial Decomposition Algorithm of Almost Quadratic Complexity, Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.471-475, July 04-08, 1988
	11	Jaime Gutierrez , Tomás Recio, Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract), Proceedings of the 1st Latin American Symposium on Theoretical Informatics, p.231-245, April 06-10, 1992
	12	Dexter Kozen , Susan Landau, Polymonial decomposition algorithms, Journal of Symbolic Computation, v.7 n.5, p.445-456, May 1989 [doi>10.1016/S0747-7171(89)80027-6]
	13	Ritt,F.: Prime and Composite polynomials. Trans. Amer. Math. Society 23, pp. 51-66 (1922).
	14	Waerden, B. van der.:Modern Algebra. Fredrick Ungar, NY (1964).
	15	Richard Zippel, Rational function decomposition, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.1-6, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120695]