Funder
Deutsche Forschungsgemeinschaft
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference49 articles.
1. Akavia, A.: Deterministic sparse Fourier approximation via fooling arithmetic progressions. In: Proceedings of 23rd COLT, pp 381–393 (2010)
2. Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. FOCS 44, 146–159 (2003)
3. Bailey, J., Iwen, M.A., Spencer, C.V.: On the design of deterministic matrices for fast recovery of Fourier compressible functions. SIAM J. Matrix Anal. Appl. 33 (1), 263–289 (2012)
4. Bittens, S.: Sparse FFT for functions with short frequency support. Dolomites Res Notes Approx. 10, 43–55 (2017)
5. Bluestein, L.I.: A linear filtering approach to the computation of discrete Fourier transform. IEEE Trans. Audio Electroacoust. 18(4), 451–455 (1970)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献