<story><title>Faster Fourier transform among world’s most important emerging technology</title><url>http://web.mit.edu/newsoffice/2012/faster-fourier-transform-named-one-of-worlds-most-important-emerging-technologies.html</url></story><parent_chain></parent_chain><comment><author>ihodes</author><text>Paper at: &lt;a href=&quot;http://arxiv.org/abs/1201.2501v1&quot; rel=&quot;nofollow&quot;&gt;http://arxiv.org/abs/1201.2501v1&lt;/a&gt;&lt;p&gt;O(k log n log(n/k)) complexity for the general case.</text></comment>
<story><title>Faster Fourier transform among world’s most important emerging technology</title><url>http://web.mit.edu/newsoffice/2012/faster-fourier-transform-named-one-of-worlds-most-important-emerging-technologies.html</url></story><parent_chain></parent_chain><comment><author>0x09</author><text>Discussion from the initial announcement in January:&lt;p&gt;&lt;a href=&quot;http://news.ycombinator.com/item?id=3480016&quot; rel=&quot;nofollow&quot;&gt;http://news.ycombinator.com/item?id=3480016&lt;/a&gt;</text></comment>