Factorization of polynomials over finite fields

From Algorithm Wiki
Revision as of 11:56, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1"...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem Description

Bounds Chart

Factorization of polynomials over finite fieldsBoundsChart.png

Step Chart

Factorization of polynomials over finite fieldsStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear
logn
Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Factorization_of_polynomials_over_finite_fields&oldid=66"