Polynomial Factorization Over Finite Fields
Polynomial Factorization Over Finite Fields is the computational problem of decomposing a univariate polynomial with coefficients in a finite field into a product of irreducible polynomials over the same field, serving as a fundamental algorithmic task in computational number theory.
239
Publications
10.6K
Citations
317
Authors
182
Institutions
Publications per year
2017–2026
14
Parents
239
Factoring Polynomials Over Finite Fields
Elwyn R. Berlekamp · Bell System Technical Journal · 1967 · 323 citations
Probabilistic Algorithms in Finite Fields
Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations
1–5 of 239
317
11
h-index
10
h-index
9
h-index
7
h-index
6
h-index
1–5 of 317
182

University of Toronto
Toronto, Canada
9 h-index
11 publications
680 citations
Clemson University
Clemson, United States
7 h-index
7 publications
234 citations

University of Waterloo
Waterloo, Canada
7 h-index
10 publications
296 citations

Carleton University
Ottawa, Canada
6 h-index
8 publications
192 citations

Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
6 publications
124 citations

Paderborn University
Paderborn, Germany
5 h-index
7 publications
226 citations
North Carolina State University
Raleigh, United States
5 h-index
5 publications
179 citations

National Academy of Sciences of Armenia
Yerevan, Armenia
4 h-index
5 publications
97 citations
1–8 of 182
MCOM · 27 publications · 1.4K citations
17
h-index
23 publications · 774 citations
17
h-index
11 publications · 359 citations
11
h-index
8 publications · 690 citations
8
h-index
8 publications · 225 citations
8
h-index
1–5