1.Overview

  FFT(Fast Fourier Transformation)

  It a simple way to calulate  polynomial multiplication with a time complexity of $O(nlogn)$