View Single Post
Old 2011-11-07, 03:30   #1
Maximus
 
Nov 2011

22×3 Posts
Exclamation low-value comments cleared out of FFT thread

Quote:
Originally Posted by LaurV View Post
I am confused here. Did you find an algorithm to multiply polynomials (in whatever complexity time) or did you find an algorithm to multiply integers in polynomial time?
Polinomials: C(x)=A(x)*B(x). And it may be used for integer multiplication. FFT does the same.
Maximus is offline