Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > SPARSE RECOVERY:
Reports tagged with sparse recovery:
TR11-147 | 2nd November 2011
Michael Forbes, Amir Shpilka

#### On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing

We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms for depth-3 set-multilinear circuits (over arbitrary fields). This class of circuits has an efficient, deterministic, white-box polynomial identity testing algorithm (due to Raz and Shpilka), but has no known such black-box algorithm. We recast this problem as ... more >>>

TR15-076 | 28th April 2015
Mahdi Cheraghchi, Piotr Indyk

#### Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

For every fixed constant $\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \in \mathbb{R}^N$ in time $k^{1+\alpha} (\log N)^{O(1)}$. Specifically, the algorithm is given query access to $x$ and computes a $k$-sparse $\tilde{x} \in \mathbb{R}^N$ satisfying \$\|\tilde{x} - \hat{x}\|_1 \leq ... more >>>

ISSN 1433-8092 | Imprint