Revision as of 22:16, 6 January 2013 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,646 edits →References: more bibliographic detail; fix Berlekamp 1970 title; remove extra whitespace between entries ← Previous edit		Revision as of 22:18, 6 January 2013 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,646 edits m more templatization Next edit →
Line 4: The worst case of this algorithm is exponential in the number of factors. {{harvtxt\|van Hoeij (\|2002)}} improved this algorithm by using the [[LLL algorithm]], substantially reducing the time needed to choose the right subsets of mod ''p'' factors. ==References== Line 70: ==External links== {{mathworld\|id=Berlekamp-ZassenhausAlgorithm\|title=Berlekamp-Zassenhaus Algorithm\|author=Domazet, Haris}} Berlekamp–Zassenhaus' algorithm at WolframMathWorld. [http://mathworld.wolfram.com/Berlekamp-ZassenhausAlgorithm.html] ==See also==

Berlekamp–Zassenhaus algorithm: Difference between revisions