An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model

Obtaining a nontrivial (superlinear) lower bound for computation of the Fourier transform in the linear circuit model has been a long-standing open problem for more than 40 years. An early result by Morgenstern from 1973, provides an Ω( n log n ) lower bound for the unnormalized Fourier transform wh...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on computation theory 2016-02, Vol.8 (1), p.1-14
1. Verfasser:	Ailon, Nir
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computation Conditioning Constrictions Entropy Fourier transforms Linear circuits Lower bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!