Berlekamp–Zassenhaus algorithm: Difference between revisions

Content deleted Content added
m References: Journal cites, Added 1 doi to a journal cite using AWB (10331)
m sp
Line 4:
The worst case of this algorithm is exponential in the number of factors.
 
{{harvtxt|vanVan 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 51:
| year = 1992}}.
*{{citation
| last = vanVan Hoeij | first = Mark
| doi = 10.1016/S0022-314X(01)92763-5
| issue = 2