Fast integer multiplication and Fourier transform (Fundamental algorithms, Spring 2023, Lecture 4)

Name: Fast integer multiplication and Fourier transform (Fundamental algorithms, Spring 2023, Lecture 4)
Uploaded: 2023-01-27T00:00:00.000Z
Duration: 1 h 6 min 22 s
Description: Karatsuba’s three-multiplication trick multiplies n-bit integers in O(n^{log₂ 3}) ≈ O(n^{1.585}) time instead of schoolbook O(n²), and the same divide-and-conquer mindset yields an O(n log n) FFT that multiplies polyn...

Kent Quanrud · 66:22

Karatsuba’s three-multiplication trick multiplies n-bit integers in O(n^{log₂ 3}) ≈ O(n^{1.585}) time instead of schoolbook O(n²), and the same divide-and-conquer mindset yields an O(n log n) FFT that multiplies polyn...

Read the full summary on tuber