Advertisement

Multivariate Polynomial Decomposition

  • Joachim von zur Gathen
  • Jaime Gutierrez
  • Rosario Rubio

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.

Keywords

Field Theory Polynomial Time Time Algorithm Polynomial Time Algorithm Multivariate Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Joachim von zur Gathen
    • 1
  • Jaime Gutierrez
    • 2
  • Rosario Rubio
    • 3
  1. 1.FB 17 Mathematik-Informatik, Universität-GH Paderborn, 33095 Paderborn, Germany (e-mail:gathen@uni-paderbrn.de)DE
  2. 2.Departamento de Matematicas y Computacion, Universidad de Cantabria, 39071 Santander, Spain (e-mail:jaime@matesco.unian.es)ES
  3. 3.Dep. Industriales, Universidad Antonio de Nebrija, 38040 Madrid, Spain (e-mail:mrubio@nebrja.es)ES

Personalised recommendations