Polynomial Decomposition is a computational algebraic method that expresses a given polynomial as a composition of simpler polynomials in a non-trivial manner, thereby revealing its underlying functional structure.
1.4K
Publications
56K
Citations
1.9K
Authors
909
Institutions
Publications per year
2017–2026
130
Parents
Publications
1.4K
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text
Decomposition methods: A new proof of convergence
Y. Cherruault, G. Adomian · Mathematical and Computer Modelling · 1993 · 458 citations
1–5 of 1.4K
Authors
1.9K
- EK
12
h-index
- SR
12
h-index
- SW
11
h-index
- JM
10
h-index
- JV
10
h-index
1–5 of 1.9K
Institutions
909
Centre National de la Recherche Scientifique
Paris, France
21 h-index
64 publications
1.9K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
15 h-index
38 publications
1.2K citations
Western University
London, Canada
15 h-index
32 publications
1.6K citations
University of Iowa
Iowa City, United States
14 h-index
20 publications
780 citations
ETH Zurich
Zurich, Switzerland
14 h-index
20 publications
962 citations
North Carolina State University
Raleigh, United States
14 h-index
20 publications
850 citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
15 publications
837 citations
Sorbonne Université
Paris, France
13 h-index
28 publications
2.2K citations
1–8 of 909
Venues
- Journal of Symbolic Computation
64 publications · 3.2K citations
29
h-index
- Linear Algebra and its Applications
58 publications · 1.5K citations
22
h-index
- Journal of Computational and Applied Mathematics
31 publications · 1.3K citations
20
h-index
- Applied Mathematics and Computation
25 publications · 1.6K citations
19
h-index
- Finite Fields and Their Applications
25 publications · 812 citations
18
h-index
1–5