Abstract.
In this paper, we discuss several notions of decomposition for multivariate polynomials, focussing on the relation with Lüroth's theorem in field theory, and the finiteness and uniqueness of decompositions. We also present two polynomial time algorithms for decomposing (sparse) multivariate polynomials over an arbitrary field.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 2, 2001; revised version: February 2, 2003
Keywords: Polynomial decomposition algorithms, Lüroth's theorem.
Rights and permissions
About this article
Cite this article
Gathen, J., Gutierrez, J. & Rubio, R. Multivariate Polynomial Decomposition. AAECC 14, 11–31 (2003). https://doi.org/10.1007/s00200-003-0122-8
Issue Date:
DOI: https://doi.org/10.1007/s00200-003-0122-8