Factorization of Polynomials Over Finite Fields: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 28: | Line 28: | ||
[[File:Factorization of Polynomials Over Finite Fields - Space.png|1000px]] | [[File:Factorization of Polynomials Over Finite Fields - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[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:39, 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
Error creating thumbnail: Unable to save thumbnail to destination
Space Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination
Space-Time Tradeoff Improvements
Error creating thumbnail: Unable to save thumbnail to destination
References/Citation
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/0020019090901954