Schubert's algorithm ( Factorization of Polynomials Over Finite Fields)

From Algorithm Wiki

Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n)$ words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n)$ words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Schubert%27s_algorithm_(_Factorization_of_Polynomials_Over_Finite_Fields)&oldid=44904"