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

< Template:Did you know nominations

This is an old revision of this page, as edited by Mandarax (talk | contribs) at 07:02, 28 July 2019 (Add "the" and "a"; I would also recommend unpiping Berlekamp's root finding algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Berlekamp's root finding algorithm

(

)

... that the original article for root finding algorithm did not contain a validity proof? Source: "The article [3] does not contain a proof for the validity of this algorithm" (Probabilistic Algorithms in Finite Fields)

Created/expanded by Adamant.pwn (talk). Self-nominated at 05:59, 28 July 2019 (UTC).

Retrieved from "https://en.wikipedia.org/w/index.php?title=Template:Did_you_know_nominations/Berlekamp%27s_root_finding_algorithm&oldid=908213136"