Content deleted Content added
→Citation needed: new section Tags: Mobile edit Mobile web edit |
Assessment: banner shell, Mathematics (Rater) |
||
| (5 intermediate revisions by 3 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=C|1=
{{WikiProject Mathematics}}
}}
== Article needs improvement ==
This is just to say that a lot of work seems to be necessary here. Lots of stuff with little rhyme or reason, like the sectioning of the article; the subsection called "example" is hard to decipher, one wonders what this is an example of. [[User:Marc van Leeuwen|Marc van Leeuwen]] ([[User talk:Marc van Leeuwen|talk]]) 14:33, 18 March 2011 (UTC)
Line 80 ⟶ 84:
:::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)
{{ping|D.Lazard}} - The Wiki article implies that Cantor–Zassenhaus will only work for odd order <math>q</math>. Is there an factoring algorithm for even order <math>q</math>, such as <math>2^n</math>? [[User:Rcgldr|Rcgldr]] ([[User talk:Rcgldr|talk]]) 03:17, 10 October 2021 (UTC)
== Square free factorization - are the polynomial coefficients GF(p) or GF(q)? ==
| |||