Tighter Fourier Transform Complexity Tradeoffs
暂无分享,去创建一个
[1] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.
[2] Martin Fürer. Faster integer multiplication , 2007, STOC '07.
[3] Rachel Ward,et al. New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property , 2010, SIAM J. Math. Anal..
[4] Nir Ailon,et al. A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy , 2013, Chic. J. Theor. Comput. Sci..
[5] Nir Ailon,et al. An almost optimal unrestricted fast Johnson-Lindenstrauss transform , 2010, SODA '11.
[6] Nir Ailon,et al. Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes , 2008, SODA '08.
[7] Nir Ailon. An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model , 2014, ArXiv.
[8] Bernard Chazelle,et al. The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors , 2009, SIAM J. Comput..
[9] Mark Rudelson,et al. Sampling from large matrices: An approach through geometric functional analysis , 2005, JACM.
[10] Anindya De,et al. Fast integer multiplication using modular arithmetic , 2008, STOC.
[11] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[12] Nir Ailon,et al. Fast and RIP-Optimal Transforms , 2013, Discrete & Computational Geometry.
[13] Christos H. Papadimitriou,et al. Optimality of the Fast Fourier transform , 1979, JACM.
[14] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[15] Piotr Indyk,et al. (Nearly) Sample-Optimal Sparse Fourier Transform , 2014, SODA.