The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform
暂无分享,去创建一个
[1] Tamás Sarlós,et al. Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[2] Nir Ailon. Tighter Fourier Transform Lower Bounds , 2015, ICALP.
[3] Christos H. Papadimitriou,et al. Optimality of the Fast Fourier transform , 1979, JACM.
[4] Guy Kindler,et al. Testing juntas [combinatorial property testing] , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[5] Christos Boutsidis,et al. Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform , 2012, SIAM J. Matrix Anal. Appl..
[6] 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..
[7] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.
[8] Ryan O'Donnell,et al. Testing properties of boolean functions , 2012 .
[9] V. Ralph Algazi,et al. Unified Matrix Treatment of the Fast Walsh-Hadamard Transform , 1976, IEEE Transactions on Computers.
[10] Nir Ailon,et al. Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation , 2016, Theor. Comput. Sci..
[11] Martin Fürer. Faster integer multiplication , 2007, STOC '07.
[12] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[13] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[14] Sivan Toledo,et al. Blendenpik: Supercharging LAPACK's Least-Squares Solver , 2010, SIAM J. Sci. Comput..
[15] Douglas F. Elliott,et al. Handbook of Digital Signal Processing: Engineering Applications , 1988 .
[16] Yishay Mansour,et al. Learning Boolean Functions via the Fourier Transform , 1994 .
[17] Gene H. Golub,et al. Matrix computations , 1983 .