FFT « Javaknitter’s Weblog

FFT

January 20, 2009

FFT=Fast Fourier Transform
can reduce time to multiply polynomials to θ(n* lg n)

Be the first to like this post.

This entry was posted on January 20, 2009 at 4:26 am and is filed under Uncategorized.

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Not published)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Twitter account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

Connecting to %s