Quote:
Originally Posted by LaurV
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.