Factorization of Polynomials Over Finite Fields (Factorization of Polynomials Over Finite Fields)

From Algorithm Wiki
Revision as of 09:10, 28 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Factor a given polynomial over a finite field into a product of irreducible polynomials.

Parameters

$n$: degree of polynomial

$p$: characteristic of finite field

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Schubert's algorithm 1940 $O(n^{3})$ $O(n)$ Exact Deterministic

Time Complexity Graph

Factorization of Polynomials Over Finite Fields - Time.png

References/Citation

https://www.sciencedirect.com/science/article/abs/pii/0020019090901954