Lines Matching refs:cutoff
2904 the cutoff point $y$ will be.
2911 influence over the cutoff point.
2915 A clean cutoff point separation occurs when a point $y$ is found such that all of the cutoff point conditions are met. For example, if the point
2916 is too low then there will be values of $m$ such that $m > y$ and the Comba method is still faster. Finding the cutoff points is fairly simple when
2942 of this system of equations has made Karatsuba fairly popular. In fact the cutoff point is often fairly low\footnote{With LibTomMath 0.18 it is 70 and 109 digits for the Intel P4 and AMD Athlon respectively.}
3052 the algorithm can be faster than a baseline multiplication. However, the greater complexity of this algorithm places the cutoff point
3053 (\textbf{TOOM\_MUL\_CUTOFF}) where Toom-Cook becomes more efficient much higher than the Karatsuba cutoff point.
3153 algorithm is not practical as Karatsuba has a much lower cutoff point.
3427 instead? The answer to this arises from the cutoff point for squaring. As in multiplication there exists a cutoff point, at which the
3428 time required for a Comba based squaring and a Karatsuba based squaring meet. Due to the overhead inherent in the Karatsuba method, the cutoff
3429 point is fairly high. For example, on an AMD Athlon XP processor with $\beta = 2^{28}$, the cutoff point is around 127 digits.
3502 This results in a cutoff point around $n = 2$. As a consequence it is actually faster to compute the middle term the ``long way'' on processors
3519 By inlining the copy and shift operations the cutoff point for Karatsuba multiplication can be lowered. On the Athlon the cutoff point
3588 & compute subsets of the columns in each thread. Determine a cutoff point where \\