Paper Info
Title
Paraunitary matrices, entropy, algebraic condition number and Fourier computation
Abstract
•We study the decades old complexity of computing the Fourier transform.•We consider a new notion of matrix condition number and explain why it is useful for this problem.•We give a new lower bound in a model defined by this notion.
Year
DOI
Venue
2016
10.1016/j.tcs.2020.02.002
Theoretical Computer Science
Keywords
Field
DocType
Fourier transform,Lower bounds,Complexity,Linear algebraic computation
Discrete mathematics,Combinatorics,Condition number,Algebraic number,Maximum modulus principle,Polynomial,Upper and lower bounds,Fourier transform,Fast Fourier transform,Conjecture,Mathematics
Journal
Volume
ISSN
Citations 
814
0304-3975
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
Nir Ailon1111470.74