We present a detailed analysis of SQUFOF, Daniel Shanks' Square Form
Factorization algorithm. We give the expected running time and space
requirement for SQUFOF. We analyze the effect of multipliers, either
used for a single factorization or when racing the algorithm in
parallel.
To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.
