On Multivariate Polynomial Decomposition

Joachim von zur Gathen (), Jaime Gutierrez () and Rosario Rubio ()
Additional contact information
Joachim von zur Gathen: Universität-GH Paderborn, FB Mathematik-Informatik
Jaime Gutierrez: Universidad de Cantabria, Departamento de Matemáticas, Estadística y Computación
Rosario Rubio: Universidad de Cantabria, Departamento de Matemáticas, Estadística y Computación

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 463-478 from Springer

Abstract: Abstract In this paper, we discuss the decomposition problem for multivariate polynomials and the possible definitions of decomposable/indecomposable polynomial. We also present a polynomial time algorithm for decomposing multivariate polynomials over an arbitrary field.

Keywords: Polynomial Time Algorithm; Complete Decomposition; Decomposition Problem; Factorial Domain; Multivariate Polynomial (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_35

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_35

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().