ConceptToom-Cook / Toom-3
Toom-Cook Algorithm
A generalization of the Karatsuba algorithm that reduces the complexity of integer multiplication to a form of O(n^(1+ε)) through k-way splitting. It was proposed independently by Toom and Cook.
Timeline (last 90 days)
Oct 13
Toom-Cook and the FFT-based Schönhage-Strassen algorithm further approach n log n.
Unverified50%