Decomposition of algebraic functions

Journal of Symbolic Computation

Volumn 22, Issue 3, 1996, Pages 235-246

  Kozen, Dexter ^a   Landau, Susan ^b   Zippel, Richard ^a  

^a School of Operations Research and Information Engineering   (United States)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16144366306     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0051     Document Type: Article

References (23)

1. Alagar, V. S., Thanh, M. (1985). Fast polynomial decomposition algorithms. In: Proc. EUROCAL85, pp. 150-153. Springer-Verlag LNCS 204.
2. Barton, D. R., Zippel, R. E. (1976). Polynomial decomposition. In: Proc. SYMSAC '76, pp. 356-358.
3. Barton, D. R., Zippel, R. E. (1985). Polynomial decomposition algorithms. J. Symbolic Computation 1:159-168.
4. Coates, J. (1970). Construction of rational functions on a curve. Proc. Camb. Phil. Soc. 68:105-123.
5. Dickerson, M. (1987). Polynomial decomposition algorithms for multivariate polynomials. Technical Report TR87-826, Comput. Sci., Cornell Univ.
6. Gutierrez, J. (1991). A polynomial decomposition algorithm over factorial domains. Comptes Rendus Mathematiques de l'Academie des Sciences, 13(2-3):81-86.
7. Hartshorne, R. (1977). Algebraic Geometry, volume 52 of Graduate Texts in Mathematics. Springer.
8. Huang, M.-D., Ierardi, D. (1991). Efficient algorithms for the effective Riemann-Roch problem and for addition in the Jacobian of a curve. In: Proc. 32nd Symp. Found. Comput. Sci., pp. 678-687. IEEE, November.
9. Ierardi, D., Kozen, D. (1993). Parallel resultant computation. In: J. Reif, (ed.), Synthesis of Parallel Algorithms, pp. 679-720. Morgan Kaufmann.
10. Kozen, D. (1994). Efficient resolution of singularities of plane curves. In: P. S. Thiagarajan, (ed.), Proc. 14th Conf. Foundations of Software Technology and Theoretical Computer Science, volume 880 of Lect. Notes in Comput. Sci., pp. 1-11. Springer.
11. Kozen, D., Landau, S. (1989). Polynomial decomposition algorithms. J. Symbolic Computation, 7:445-456.
12. Kozen, D., Landau, S., Zippel, R. (1994). Decomposition of algebraic functions. In: L. Adleman and M.-D. Huang, (eds), Proc. First Algorithmic Number Theory Symposium (ANTS), volume 877 of Lect. Notes in Comput. Sci., pp. 80-92. Mathematical Sciences Institute, Springer.
13. Landau, S. (1985). Factoring polynomials over algebraic number fields. SIAM J. Comput., 14(1):184-195.
14. Lang. S. (1984). Algebra. Addison-Wesley, second edition.
15. Lenstra, A. K. (1983). Factoring polynomials over algebraic number fields. In: Proc. EuroCal 1983, volume 162 of LNCS, pp. 245-254. Springer.
16. Sendra, J. R., Winkler, F. (1991). Symbolic parametrization of curves. J. Symbolic Computation, 12:607-631.
17. Trager, B. M. (1984). Integration of Algebraic Functions. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
18. van der Waerden, B. L. (1970a). Algebra, volume 2. Frederick Ungar, fifth edition.
19. van der Waerden, B. L. (1970b). Algebra, volume 1. Frederick Ungar, fifth edition.
20. von zur Gathen, J. (1990a). Functional decomposition of polynomials: the tame case. J. Symbolic Computation, 9:281-299.
21. von zur Gathen, J. (1990b). Functional decomposition of polynomials: the wild case. J. Symbolic Computation, 10:437-452.
22. Zippel, R. E. (1991). Rational function decomposition. In: S. Watt, (ed.), International Symposium on Symbolic and Algebraic Computation, pp. 1-6, New York: ACM.
23. Zippel, R. E. (1993). Effective Polynomial Computation. Boston: Kluwer Academic Press.