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

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O(n^{3})$

== Space Complexity == 

$O(n)$ words

()

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word RAM

== Year == 

1940

== Reference == 

-

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Schubert%27s_algorithm_(_Factorization_of_Polynomials_Over_Finite_Fields)"

Navigation menu