Nearly optimal deterministic algorithm for sparse walsh-hadamard transform
暂无分享,去创建一个
[1] Mahdi Cheraghchi,et al. Applications of Derandomization Theory in Coding , 2011, ArXiv.
[2] Martin Vetterli,et al. A fast Hadamard transform for signals with sub-linear sparsity , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[3] Adi Akavia,et al. Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions , 2014, IEEE Transactions on Information Theory.
[4] Piotr Indyk,et al. Nearly optimal sparse fourier transform , 2012, STOC '12.
[5] V. Shoup. New algorithms for finding irreducible polynomials over finite fields , 1990 .
[6] Ely Porat,et al. Polynomials: a new tool for length reduction in binary discrete convolutions , 2014, ArXiv.
[7] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[8] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[9] Venkatesan Guruswami,et al. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes , 2009, JACM.
[10] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[11] Piotr Indyk,et al. Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data , 2014, IEEE Signal Processing Magazine.
[12] Holger Rauhut,et al. A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.
[13] Martin Vetterli,et al. A Fast Hadamard Transform for Signals With Sublinear Sparsity in the Transform Domain , 2015, IEEE Trans. Inf. Theory.
[14] Mark A. Iwen,et al. Combinatorial Sublinear-Time Fourier Algorithms , 2010, Found. Comput. Math..
[15] A.C. Gilbert,et al. A Tutorial on Fast Fourier Sampling , 2008, IEEE Signal Processing Magazine.
[16] M. A. Iwen,et al. Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms , 2010, ArXiv.
[17] Eyal Kushilevitz,et al. Learning Decision Trees Using the Fourier Spectrum , 1993, SIAM J. Comput..
[18] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.