Berlekamp's algorithm (Distinct-degree; Equal-degree Factorization of Polynomials Over Finite Fields): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3} logn)$ == Space Complexity == $O(n)$ words (Computes the remainder of $g^{((p-1)/2)}-1 mod f$ (in order to find gcd of $g^{((p-1)/2)}-1$ and f)) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 1967 == Reference == https://ieeexplore.ieee.org/document/6768643/") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{3} | $O(n^{3} \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:56, 10 April 2023
Time Complexity
$O(n^{3} \log n)$
Space Complexity
$O(n)$ words
(Computes the remainder of $g^{((p-1)/2)}-1 mod f$ (in order to find gcd of $g^{((p-1)/2)}-1$ and f))
Description
Approximate?
Exact
Randomized?
Yes, Monte Carlo
Model of Computation
Word RAM
Year
1967