Factorization of Polynomials Over Finite Fields (Factorization of Polynomials Over Finite Fields)
Revision as of 10:23, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Factorization of Polynomials Over Finite Fields (Factorization of Polynomials Over Finite Fields)}} == Description == Factor a given polynomial over a finite field into a product of irreducible polynomials. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Schubert's algorithm (...")
Description
Factor a given polynomial over a finite field into a product of irreducible polynomials.
Parameters
No parameters found.
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
Space Complexity graph
Pareto Decades graph
References/Citation
https://www.sciencedirect.com/science/article/abs/pii/0020019090901954