FFT based multiplication of large numbers

(Click here for a Postscript version of this page.)

Multiplication of large numbers of n digits can be done in time O(nlog(n)) (instead of O(n2) with the classic algorithm) thanks to the Fast Fourier Transform (FFT). This page presents this technique along with practical considerations.

Basic definitions and notations about large number representation can be found in Arbitrary precision computation.

 

این مقاله مربوط به الگوریتم ضرب اعداد بزرگ به کمک سری فوریه هستش که زحمت ترجمش دیگه با خودتون

لبنک به سایت اصلی