Revision as of 06:00, 28 July 2019 edit Adamant.pwn (talk \| contribs) Template editors 287 edits Nominating Berlekamp's root finding algorithm for DYK		Revision as of 07:02, 28 July 2019 edit undo Mandarax (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 388,559 edits m Add "the" and "a"; I would also recommend unpiping Berlekamp's root finding algorithm Next edit →
Line 11: --> * ... that the original article for '''[[Berlekamp's root finding algorithm\|root finding algorithm]]''' did not contain a validity proof? <small>Source: "The article [3] does not contain a proof for the validity of this algorithm" ([https://epubs.siam.org/doi/10.1137/0209024 Probabilistic Algorithms in Finite Fields])</small> :* <small>Created/expanded by [[User:Adamant.pwn\|Adamant.pwn]] ([[User talk:Adamant.pwn\|talk]]). Self-nominated at 05:59, 28 July 2019 (UTC).</small>

Template:Did you know nominations/Berlekamp's root finding algorithm: Difference between revisions