Fast Fourier Transform Tree Example | Part 4
Smart Contract Programmer · 8:43
This video walks through an n=8 number-theoretic FFT on a degree-7 polynomial, using a recursion tree to show how even/odd splits and domain squaring set up the recursive calls (algorithm step 3). The tree shrinks one...