Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields)
Jump to navigation
Jump to search
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
-