Pages that link to "Item:Q5383996"
From MaRDI portal
The following pages link to (Nearly) Sample-Optimal Sparse Fourier Transform (Q5383996):
Displayed 9 items.
- A deterministic sparse FFT algorithm for vectors with small support (Q281476) (← links)
- Fast Haar transforms for graph neural networks (Q1982431) (← links)
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) (← links)