Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 517 bytes +517‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Keeps track of a set of factors, where sum of degrees of factors is $O(n)$ so the total number of terms to keep track of is $O(n)$. Also, polynomials in the separating set can be computed in $O(n)$ space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://www.sciencedirect.co..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Victor_Shoup%27s_algorithm_(Equal-degree_Factorization_of_Polynomials_Over_Finite_Fields)"