Question: [Integer multiplication using Fast Fourier Transformation] Given two nbit integers a and b, give an algorithm to multiply them in O(n log(n)) time. Use the
[Integer multiplication using Fast Fourier Transformation]
Given two nbit integers a and b, give an algorithm to multiply them in O(n log(n)) time. Use the FFT algorithm from class as a black-box (i.e. dont rewrite the code, just say run FFT on ...).Explain your algorithm in words and analyze its running time.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
