3 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Yiping Cheng
The traditional Karatsuba algorithm for the multiplication of polynomials and multi-precision integers has a time complexity of O(n1.59) and a space complexity of O(n). Roch…