Rational function decomposition

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Rational function decomposition

Full text

Pdf (552 KB)

Source

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

Bonn, West Germany

Pages: 1 - 6

Year of Publication: 1991

ISBN:0-89791-437-6

Author

Richard Zippel

Cornell University, Ithaca, NY

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 54, Citation Count: 11

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/120694.120695 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	Vangalur S. Alagar , Mai Tanh, Fast Polynominal Decomposition Algorithms, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.150-153, April 01-03, 1985
	2	David R. Barton , Richard E. Zippel, A polynomial decomposition algorithm, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.356-358, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806356]
	3	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]
	4	Matthew Thomas Dickerson, The functional decomposition of polynomials, 1989
	5	~. "The inverse of an automorphism in polynomial time". In 30th Symposium on Foundations of Compuler Science, pages 82-87. ACM, 1989.
	6	F. Dorey and G. Whaples. "Prime and composite polynomials". Journal of Algebra, 28:88101, 1974.
	7	J. Guti6rrez, T. Recio, and C. Ruiz de Velasco. "Polynomial decomposition algorithm of almost quadratic complexity". In Proceedings of AAECC- 6, 1988. Springer-Verlag, 1989.
	8	R. Jenks, editor. Symbolic and Algebraic Compuration '76", New York, August 1976. ACM.
	9	E. Kaltofen. "Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorizations". SIAM Journal of Computing, 14:469-489, 1985.
	10	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	11	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]
	12	H. T. Kung , J. F. Traub, All Algebraic Functions Can Be Computed Fast, Journal of the ACM (JACM), v.25 n.2, p.245-260, April 1978 [doi>10.1145/322063.322068]
	13	S. Landau. "Factoring polynomials over algebraic number fields". SIAM Journal of Computing, 14( 1):184-195, 1985.
	14	S. Landau and G. L. Miller. "Solvability by radicals is in polynomial time". Journal of Computer and System Sciences, 30(2)'179-208, April 1985.
	15	P. Lfiroth. "Beweis eines Satzes fiber rationale Curven". Mathematische Annalen, 9:163-165, 1876.
	16	R. J. McEliece and J. B. Shearer. "A property of Euclid's algorithm and an application to Pad6 approximation". SIAM Journal of Applied Mathematics, 34:611--615, 1978.
	17	A. Schinze}. Selected Topics on Polynomials. llniversity of Michigan Press, Ann Arbor, MI, 1982.
	18	E. Steinitz. "Algebraische Theorie der KSrper". Journal fiir reine ~nd angewante Mathematik, 137:167-309, 1910.
	19	Barry M. Trager, Algebraic factoring and rational function integration, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.219-226, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806338]
	20	B. L. van der Waerden. Modern Algebra. Fredrick Ungar, New York, NY, 1964.
	21	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]
	22	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]
	23	J. von zur Gathen, D. Kozen, and S. Landau. "Functional decomposition of polynomials". In 28th Symposium on Foundations of Computer Science, pages 127-131. ACM, 1987.
	24	H. Weber. Lehrbuch der Algebra, volume II. Chelsea Publishing Co., New York, third edition, 1961.

CITED BY 11

	Robert M. Corless , Mark W. Giesbrecht , David J. Jeffrey, Approximate polynomial decomposition, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.213-219, July 28-31, 1999, Vancouver, British Columbia, Canada
	Jaime Gutierrez , Tomas Recio, A practical implementation of two rational function decomposition algorithms, Papers from the international symposium on Symbolic and algebraic computation, p.152-157, July 27-29, 1992, Berkeley, California, United States
	Jaime Gutierrez , Rosario Rubio , David Sevilla, On multivariate rational function decomposition, Journal of Symbolic Computation, v.33 n.5, p.545-562, May 2002
	Jürgen Weiß, Homogeneous decomposition of polynomials, Papers from the international symposium on Symbolic and algebraic computation, p.146-151, July 27-29, 1992, Berkeley, California, United States
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Jamie Gutierrez , Rosario Rubio , David Sevilla, Unirational fields of transcendence degree one and functional decomposition, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.167-174, July 2001, London, Ontario, Canada
	Xiao-Shan Gao , Mingbo Zhang, Decomposition of differential polynomials with constant coefficients, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.175-182, July 04-07, 2004, Santander, Spain
	Hyungjick Lee , Jim Alves-Foss , Scott Harrison, The construction of secure mobile agents via evaluating encrypted functions, Web Intelligence and Agent System, v.2 n.1, p.1-19, August 2004
	Stephen M. Watt, On the functional decomposition of multivariate laurent polynomials (abstract only), ACM Communications in Computer Algebra, v.42 n.1-2, March/June 2008
	Mohamed Ayad , Peter Fleischmann, On the decomposition of rational functions, Journal of Symbolic Computation, v.43 n.4, p.259-274, April, 2008
	Marc Dohm, Implicitization of rational ruled surfaces with µ-bases, Journal of Symbolic Computation, v.44 n.5, p.479-489, May, 2009