Lines Matching full:cook
1158 specific multiplication routines optimized for given parameters. First there are the Toom-Cook multiplications which
1231 Both of the Toom-Cook and Karatsuba multiplication algorithms are faster than the traditional $O(n^2)$ approach that
1234 multiplications with Toom-Cook or 100,000,000 single precision multiplications with the standard Comba (a factor
1237 So why not always use Karatsuba or Toom-Cook? The simple answer is that they have so much overhead that they're not
1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points
1271 good Karatsuba squaring and multiplication points. Then it proceeds to find Toom-Cook points. Note that the Toom-Cook
