Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform

Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform

For every fixed constant α > 0, we design an algorithm for computing the k-sparse Walsh-Hadamard transform (i.e., Discrete Fourier Transform over the Boolean cube) of an N-dimensional vector x ∈ R[superscript N] in time k[superscript 1 + α](log N)[superscript O(1)]. Specifically, the algorithm is...

Full description

Bibliographic Details
Main Authors: Cheraghchi, Mahdi (Author), Indyk, Piotr (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2018-02-26T21:44:54Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items