Cantor–Zassenhaus algorithm: Difference between revisions

Content deleted Content added
m Rollback edit(s) by 31.164.170.101 (talk): Vandalism (from contribs) (RW 16.1)
Importing Wikidata short description: "Algorithm for factoring polynomials over finite fields"
Line 1:
{{Short description|Algorithm for factoring polynomials over finite fields}}
In [[Computational mathematics|computational]] [[Abstract algebra|algebra]], the '''Cantor–Zassenhaus algorithm''' is a method for factoring [[polynomial]]s over [[finite field]]s (also called Galois fields).