Revision as of 19:15, 14 July 2020 edit D.Lazard (talk \| contribs) Extended confirmed users 35,640 edits →Square free factorization - are the polynomial coefficients GF(p) or GF(q)?: rp ← Previous edit		Revision as of 00:55, 15 July 2020 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Trying to understand how any of these methods would work for f(x) with coefficients in GF(p^r) Next edit →
Line 79: ::Does the Berlekamp algorithm loop on all 2^16 elements of GF(2^16) or on all 2^32 combinations of 2 elements of GF(2^16)? [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 17:54, 13 July 2020 (UTC) :::As far as I remember, it loops on all 2^16 elements of GF(2^16). In any case, Cantor–Zassenhaus is probably more efficient on this size of problems. I agree that the article [[Berlekamp's algorithm]] is not clearly written. If you want to be sure look at one of the numerous textbooks that describe these algorithms in details. Wikipedia is not a textbook, and is not aimed to replace textbooks. [[User:D.Lazard\|D.Lazard]] ([[User talk:D.Lazard\|talk]]) 18:26, 13 July 2020 (UTC) {{outdent}}For Distinct-degree factorization algorithm, on the very first step (i==1), <math>g=\gcd(f, x^{q}-x)</math> = 1, same issue as the first algorithm. The size of the coefficients doesn't seem to matter if the values start off as 0 and 1. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 00:54, 15 July 2020 (UTC) == Square free factorization - are the polynomial coefficients GF(p) or GF(q)? ==

Talk:Factorization of polynomials over finite fields: Difference between revisions