R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT (Q4566645)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT |
scientific article; zbMATH DE number 6895612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT |
scientific article; zbMATH DE number 6895612 |
Statements
R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT (English)
0 references
27 June 2018
0 references
