Content deleted Content added
m Reverted edits by 2600:1700:2370:C9B0:B967:67B5:D2BE:25A4 (talk) (HG) (3.3.5) |
remove Gauss's name, not backed up by cited source, and already deleted in revision 784326453 in another place, but this one was missed. |
||
Line 328:
Karatsuba's algorithm is the first known algorithm for multiplication that is asymptotically faster than long multiplication,<ref>D. Knuth, ''The Art of Computer Programming'', vol. 2, sec. 4.3.3 (1998)</ref> and can thus be viewed as the starting point for the theory of fast multiplications.
In 1963, Peter Ungar suggested setting ''m'' to ''i'' to obtain a
# compute ''b'' · ''d'', call the result ''F''
# compute ''a'' · ''c'', call the result ''G''
| |||