Factorization of Polynomials Over Finite Fields: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: degree of polynomial | |||
$p$: characteristic of finite field | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 23: | Line 25: | ||
[[File:Factorization of Polynomials Over Finite Fields - Time.png|1000px]] | [[File:Factorization of Polynomials Over Finite Fields - Time.png|1000px]] | ||
== References/Citation == | == References/Citation == | ||
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954 | https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954 | ||
Latest revision as of 10:10, 28 April 2023
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
References/Citation
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954