(Solved) : 2 Marks Describe Multiply Two N Degree Polynomials Together O N Logn Time Using Fast Fouri Q36463406 . . .
[2 marks]Describe how to multiply two n-degree polynomialstogether in O(n logn) time, using the Fast Fourier Transform (FFT).You do not need to explain how FFT works – you may treat it as ablack box.
In this part we will use the Fast Fourier Transform (FFT)algorithm described in class to multiply multiple polynomialstogether (not just two).
Suppose you have K polynomials P1, . . . , Pk so that
degree(P1) +···+ degree(PK) =S
(i)[6 marks]Show that you can find the product of these Kpolynomials in O(K SlogS)time.
Hint: How many points do you need to uniquely determine anS-degree polynomial?
(ii)[12 marks]Show that you can find the product of these Kpolynomials in O(S logS logK)time.
Hint: consider using divide-and-conquer; a tree which you usedin the previous assignment might be helpful here as well. Also,remember that if x, y, z are all positive, then log(x+y)
Expert Answer
Answer to 2 Marks Describe Multiply Two N Degree Polynomials Together O N Logn Time Using Fast Fouri Q36463406 . . .
OR