Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Flouro, Aaron R., Chadwick, Shawn P.
Format:	Preprint
Published:	2026
Subjects:	Signal Processing Data Structures and Algorithms Information Theory 65T50, 68Q25 F.2.1; G.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2604.18911