Factorization of Polynomials Over Finite Fields: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: degree of polynomial | |||
$p$: characteristic of finite field | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 08:22, 10 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
Error creating thumbnail: Unable to save thumbnail to destination
Space Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination
Time-Space Tradeoff
Error creating thumbnail: Unable to save thumbnail to destination
References/Citation
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954