Yu. Ofman coauthored the 1962 paper Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. The work reduces a multiplication of large integers to three smaller multiplications rather than four, yielding the divide-and-conquer recurrence behind Karatsuba multiplication. It is an early example where an algebraic rearrangement changes an algorithm's asymptotic cost.[ref]
Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. paper and three-product identity
New to topics? Read the docs here!