Revision as of 10:48, 3 October 2012 edit D.Lazard (talk \| contribs) Extended confirmed users 35,640 edits m D.Lazard moved page Talk:Factorization of polynomials over a finite field and irreducibility tests to Talk:Factorization of polynomials over finite fields: Too long title. Irreducibility testing is a part of factorization ← Previous edit		Revision as of 02:20, 8 February 2014 edit undo MvH (talk \| contribs) Extended confirmed users 706 edits →Article needs improvement Next edit →
Line 1: == 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) :The article lacks a clear purpose. Cantor-Zassenhaus is given here even though it has its own wiki page, while recent algorithms with subquadratric complexity are not even mentioned. I propose deleting large portions, and reduce the article to a list of references to other places.[[User:MvH\|MvH]]. == Needs more Mathematical Methods and less computer algorithms ==

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