Jim Wendelberger Science and Mathematics Blog

The Fast Fourier Transform

Inverse

Convert convolutions into multiplication

Quick way to multiply two polynomials

Quantum computer to factorize large integers with fast fourier transform and a result of Peter Shor.

This entry was posted on Monday, May 31st, 2010 at 08:05 and is filed under The Princeton Companion to Mathematics. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.