Right, and if we are trying to get all coefficients and are thus performing the polynomial multiplications symbolically, then performing the multiplications nai

Right, and if we are trying to get all coefficients and are thus performing the polynomial multiplications symbolically, then performing the multiplications naively will take O(n^2) time but using FFT allows it to be done in O(n log n) time.