Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time (Q5361835)
From MaRDI portal
scientific article; zbMATH DE number 6784076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time |
scientific article; zbMATH DE number 6784076 |
Statements
Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time (English)
0 references
29 September 2017
0 references
sparse Fourier transform
0 references
sublinear algorithms
0 references
