Register

Recent questions tagged fast-fourier-transform

0 0 votes
1 1 answer
718
718 views
UGC NET CSE | December 2019 | Part 2 | Question: 42
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is:$\theta(n \lg n)$$\theta(n^2)$$\theta(n)$$\theta(\lg n)$
User Avatar
To see more, click for the full list of questions or popular tags.