How is multiplication of Polynomials implemented? With the basic O(n^2) algorithm or the Fast Fourier Transform O(n log n) algorithm?