Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
[p_dft[i]*q_dft[i] for i in range(g)] # Compute the inverse fourier transform using R vector r_idft = fft(r, omega_inv) # Final coefficient vector. # Round the coefficients to nearest integer since for integer # multiplication, coefficients must be integers. c = [round(x.real/g, round_decimal) for