Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields)
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n)$ words (Computes and stores a constant number of polynomials of degree $O(n)$ per iteration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == -")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n)$ words
(Computes and stores a constant number of polynomials of degree $O(n)$ per iteration)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1975
Reference
-