Factorization of Polynomials Over Finite Fields: Difference between revisions
Jump to navigation
Jump to search
(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 (...") |
No edit summary |
||
| Line 20: | Line 20: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Factorization of Polynomials Over Finite Fields - Time.png|1000px]] | [[File:Factorization of Polynomials Over Finite Fields - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Factorization of Polynomials Over Finite Fields - Space.png|1000px]] | [[File:Factorization of Polynomials Over Finite Fields - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Factorization of Polynomials Over Finite Fields - Pareto Frontier.png|1000px]] | [[File:Factorization of Polynomials Over Finite Fields - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 2023
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 Frontier Improvements Graph
References/Citation
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954